Binary String Power of Two Regex

Problem Statement

Binary String Power of Two Regex Problem Description Given a binary string, find a regex that checks whether that binary number when converted to a decimal number is a power of two or not. Complete the code in the editor below by replacing the blank (i.e., "_______") with a regular expression that matches something according to the criterion above. Locked code in the editor prints True for each correct match and False for each incorrect match. Input from stdin will be processed as follows and passed to the function. The first line consists of an integer, n, the number of binary strings to follow. Each of the next n lines contains a string representation of a binary number. Examples Example 1: Input: s = '0101010' Output: False Explanation: The binary string '0101010' converts to 42 in decimal, which is not a power of 2. The regex should return a false value. Example 2: Input: 4 1000 0100 0010 0110 Output: True True True False Explanation: Binary '1000' is 8 in decimal (2³), which is a