Design a regular language where every sentence has to start with any number of strings 101 (any number is none or more), then repeats 00 any number of times, then repeats 01 at least once. Use regular expression notation. Clarification: alphabet is {0,1}. 'string' is the same as program, but here the programs are written using binary alphabet in a silly language.