2. Consider the central server model shown below. A process at CPU requests a disk 1/O after completing an exponentially distributed service. It joins disk O with probability P1, disk 1 with probability P2 and disk 2 with probability P3 (P1+P2+P3=1). After receiving an exponentially distributed service at a disk process goes back to CPU queve. This is a closed system with N jobs circulating in the system. There is no blocking in the system (that is the queue size including the one in service is greater than or equal to N ). Draw the flowchart of the departure process from CPU. 2. Consider the central server model shown below. A process at CPU requests a disk 1/O after completing an exponentially distributed service. It joins disk O with probability P1, disk 1 with probability P2 and disk 2 with probability P3 (P1+P2+P3=1). After receiving an exponentially distributed service at a disk process goes back to CPU queve. This is a closed system with N jobs circulating in the system. There is no blocking in the system (that is the queue size including the one in service is greater than or equal to N ). Draw the flowchart of the departure process from CPU