Finite$-$State Machine $(16$ points$)$

$($a$)$ Please construct a finite$-$state machine that will compute the bitwise OR of two binary input string. $(8$ points$)$

OLA$6$

$($Please draw the finite$-$state machine$)$

$($b$)$ Write the output for the input sequence consisting of the strings $11011$ and $10010($read left to right$)(8$ points$)$

$($For the output, please ignore the first bit for the initial state.$)$

$($Please draw the time table how to get the output$)$