Q$1.$ Is it possible for the system to reach a marking that indicates the helicopter is ready to travel to the scene of the incident $($and no tokens in other places irrelevant to the helicopter ready to depart$)?$ If so$,$ how many $($different$)$ execution sequences exist that can reach such marking? For each execution sequence, describe the scenario captured by the execution sequence. If not, why not and how is this shown in the reachability graph?

Q$2.$ Is the system free from deadlocks? If not, is it possible to fix the issue so that the revised system is deadlock$-$free? If it is deadlock free, describe how you know this?$$ Provide the semantical analysis and discuss the evidence.$$ What factors within the reachability graph support your response?

Q$3.$ Does the system suffer from unboundedness? If so$,$ is it possible to fix the issue so that the revised system is bounded? If the system is bounded, describe how you know this? Provide the semantical analysis and discuss the evidence.$$ What factors within the reachability graph support your response?