Make a finite state machine diagram for the following problem:

please include a truth table and/or logic design.

Problem #3: Traffic Light Controller- the following statements define the behavior of this traffic light controller (never mind if it does not make sense in real life). 1. Traffic sensors: TA, TB (TRUE when there's traffic) 2. Lights:-LA, LB in different directions. LA north - south and LB east-west. 3. If LA-GREEN, then LA remains GREEN as long as A has cars (ie. TA = 1) 4.fLB-GREEN, then LB remains GREEN as long as B has cars (i.e. TB # 1) 5. Light colors change (GREEN, RED) (YELLOW, RED) (RED, GREEN) 6. Light Yellow transitions to red after time Tsec becomes logical 1 (when it reaches 4 seconds). 7, Starting state: LA-Green LB-Red and TA # 1