Consider the model of a packet switch Packets arrive from outside to nodes 1 and 2. Packets depart from nodes 3 and 4. A packet completing its service at node 1 goes to node 3 with probability q and goes to node 4 with probability (1-q). Similarly, a packet completing its service at node 2 goes to node 3 with probability (1-p) and goes to node 4 with probability p. All interarrival times and service times are exponentially distributed. There is no buffer in the system only the spaces in front of server. That is there can be either no packet at a node or one packet receiving service. Upon completion of its service at nodes 1 and 2 a packet attempts to go to node 3 or node 4 (with defined probabilities shown in the above picture). If at that time there is a packet receiving service at the destination node the packet is lost (there is no place to wait). Draw the flowchart of the departure process from node 1 and the departure process to calculate the number of lost packets and departure process from node 4 to calculate the probability node 4 is idle (no packet receiving service)