Ice-cream shops problem. A set of small ice-cream shops get their ice-cream from a storage that has capacity of M containers. When a shop is short on ice-cream, it sends a track and get a container of ice-cream unless the storage is empty, in which case the shop truck waits until the storage becomes full. If the storage is empty, a big storage truck arrive with M containers. There is no partial refilling of the storage. Model the behaviour of the system as FSP processes. Model the behaviour of the system as an Elementary Petri net (see Lecture Notes 3) Model the behaviour of the system as an Place Transition Petri net (see Lecture Notes 9, pages 21, 22). Model the behaviour of the system as an Coloured Petri net (see Lecture Notes 9, pages 23-34) Discuss the differences between the FSP and various Petri Net solutions. Implement the system Java program. (a) (b) (c) (d) (e) (f) Ice-cream shops problem. A set of small ice-cream shops get their ice-cream from a storage that has capacity of M containers. When a shop is short on ice-cream, it sends a track and get a container of ice-cream unless the storage is empty, in which case the shop truck waits until the storage becomes full. If the storage is empty, a big storage truck arrive with M containers. There is no partial refilling of the storage. Model the behaviour of the system as FSP processes. Model the behaviour of the system as an Elementary Petri net (see Lecture Notes 3) Model the behaviour of the system as an Place Transition Petri net (see Lecture Notes 9, pages 21, 22). Model the behaviour of the system as an Coloured Petri net (see Lecture Notes 9, pages 23-34) Discuss the differences between the FSP and various Petri Net solutions. Implement the system Java program. (a) (b) (c) (d) (e) (f)