The graph(state machine ). Please make a summary of what is done.

2. The state of a registered user account: This should include states such as "awaiting payment" but also states that, for example, indicate that the user currently has a bike (to prevent them from taking out a second bike at the same time). Each transition should be marked with what input causes the transition (e.g. messages such as "bike removed", "outstanding balance paid", etc.). No output is needed. Construct a diagram showing the state machine and a table showing the transition table. Make sure you clearly identify the input alphabet you're using, the initial state and any final states (if here are any) and what transitions are triggered by what input. n your individual summary, please summarize your machine (focus on the essential aspects; not need to describe every detail) and answer the following questions: Why is the first machine a non-deterministic machine? How would a deterministic one be more :omplicated? Is the second machine deterministic or not? Why did we use Moore machine here? The State of a Registered User Account Input Alphabet: ={M,R,P,B,D} M: Bike removed R : Bike returned in good condition P: Outstanding balance paid B: Bike returned in damaged condition D: Damage fee paid Initial State: Account Paid Final State: None - this is a closed-loop system