PLEASE JUST MAKE A SUMMARY OF THE GRAPH BELOW. IT A STATE MACHINE. On the graph you can see the states and the triggers. Please make a summary of the transitions

or this lab, we will focus on modeling two aspects in greater detail using finite state machines (Moore nachines): 1. The state of a docking station. To help you get started, here are a set of states to work with: a. Station out of service b. Station has bikes and docks available c. Station has no bikes available d. Station has only bikes in need of repair e. Station has no docks available As input alphabet, think of them as "trigger" that will cause a change in state. For example, an input might be "bike removed" or "bike returned". Think of all possible inputs. Then construct a diagram showing the state machine (with initial state and final states) and a separate transition table. Note that this is likely a non-deterministic state machine. You're asking in your individual write-up to explain why. Input Alphabet: ={R,M,B,P,D,A,S,E} R= Bike returned in good condition M= Bike removed B= Bike returned in damaged condition P= Bike repaired D= Dock damaged A = Dock repaired S= Station damaged E= Station repaired