f$)$ Design a regular expression that accepts the language of all binary strings which their length is odd with no occurrences of $11.[3$ marks$]$