The state transition table for a finite state machine is given below:

a b ---------------- 0 | 2 0 1 | 1 1 2 | 1 3 3 | 2 3

Suppose the above machine is a Moore machine with starting state 0, and state 3 is the only accept state. Write a regular expression that describes the set of strings accepted by the Moore machine defined above.