Create a regular expression for the language of all binary strings

such that

and

contains exactly one $1.$

The goal of this series of questions is to guide you through one possible approach to solving this problem. This is not the only approach, and we are not trying to suggest that it is the best approach.

Notice that strings in this language are of the form

$.$ Adhering to the definition of the language, what must be true of

and

$?$

$*$Grading note: If the answer is $"4$ mod $7",$ we will not accept equivalent answers such as $"11$ mod $7".$

integer

mod

integer

$.$