A process at CPU requests a disk I$/$O after completing an exponentially distributed service. It joins disk $0$ with probability P$1,$ disk $1$ with probability P$2$ and disk $2$ with probability P$3($P$1+$P$2+$P$3=1).$ After receiving an exponentially distributed service at a disk process goes back to CPU queue. 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 system.