Consider the following Petri Net with the initial state as shown in the figure. Note that this Petri Net has four places. The state of the Petri Net can be described as [N, N2, Na, N4], where N, represents the number of kens in place p1Sis4. The following initial state can therefore be represented as [1, 0, 0,2) P4 2 2 P2 P3 (1) After the Petri Net fires four times, find a state such that all transitions are dead. Write down the resulting state of [Ni, N2,N, N]. (2 points) initial state of the Petri Net. We work out the following corresponding sequence. (4 points) (a) Can we file the sequence once? If so, what is the resulting state of N1, N2,N3, N4)? (b) Can we file the sequence twice? If so, what is the resulting state of N1, N2,N, NJ? (c) Can we file the sequence three times? If so, what is the resulting state of IN, Na, N NJ (d) Conclusion: Can the sequence be repeated infinitely? If yes, explain why. If not, indicate where it (2) We would like to find out if we can repeat the firing seqeinfinitely often from the fails to repeat