write a regular expression for the set of binary strings where each string has at least one pair of consecutive zeros 6 2 8:52 AM

Q3/ Write a program which produce a simple multiplication table of the following format for integers in the range 1 to 9: 1x1=1 1x2=2 ..... 9x9=81

Write a regular expression for each of the following sets of binary strings. Use only the basic operations. contains the substring 110 doesn't contain the substring 110 whose tenth symbol from the right is 1 not containing 101 as a substring

Given two numbers, return true if the sum of both numbers is less than 100. Otherwise return false. Examples lessThan100 (22, 15) → true // 22 + 15 = 37 less Than100 (83, 34) // 83 + 34 = 117 - false less Than100 (3, 77) → true

using iostream domain and for loop

Java - Convert to Reverse Binary

this code only prints random dna letters where is the game there are the questions below Find the complement of a DNA strand: recall that a DNA strand is a combination of fouruppercase letters; A, T, C, and G. The letters A and T are complements, and the letters Cand G are complements. To find the complement of a DNA strand you must replace eachcharacter with its complement. For example, ATCGG is the complement of TAGCC andCCC is the complement of GGG. Your program must show a DNA of a predefined lengthto the player and ask for its complement.2. Find the reversed DNA strand: the order of the characters in a DNA strand should bereversed. Examples: GCTAA is the reverse of AATCG and AA is the reverse of AA. Yourprogram must show a DNA of a predefined length to the player and ask for the reversedstrand.3. Find the compressed DNA strand: all repeated characters in a DNA strand should bereplaced by the number of repeats followed by that character once. For example, 2C3ATis the compressed…

Please explain why the answer is T.

Write a program that uses two nested for loops and the modulus operator (%) to detect and print all prime numbers from 1 to 10,000. Prime numbers are integral numbers that are only evenly divisible by themselves and one (1). Display all the prime numbers found.

Python please I need help with this problem from zybooks