A binary string is a sequence of zeros and ones (e.g. 011011). As such, the regular expression [01]+ corresponds to the pattern that describes all possible binary strings.

Assignment

The current directory contains the text file binary.txt¹ containing binary strings, each on a separate line. Use a command from the grep family to restrict the list to the binary strings that

1. end with 00 (224 lines)

2. start and end with 1 (178 lines)

3. contain the substring 110 (543 lines)

4. contain at least three ones (655 lines)

5. contain at least three consecutive ones (390 lines)

With each description we give the number of matching binary strings (lines) in the file binary.txt² between round brackets. Try to keep the regular expressions as concise as possible.