Moore Machine Operation

Given a Moore Machine with the input alphabet $\backslash$Sigma $=\{$a$,$ b$\},$ output alphabet $\backslash$Gamma $=\{0,1\},$ and states q$0,$ q$1,$ q$2,$ q$3($q$0=$ start state$),$ trace the operation of the machine on the input string "aaababbaabb".