I was wondering if I could get help solving this Linux problem.

Note: the binary_strings file simply lists all binary numbers from 0000000000-1111111111

Write a regular expression for each of the following sets of binary strings. Note: rely on regular expressions, but only the regular and extended regular expression syntax. A file has been provided for you to test your work on: /courses/csci345/data/binary string a. any string except 11 or liil5 points) every odd symbol is a..(5 points) (Note: the leftmost bit is in position 1, an odd position) b. c. contains at least two Os and at most one 1 (7 points) d. no consecutive 1s (8 points)