Problem 1 You are given an M/M/1 queueing system in which the expected waiting time and expected number in the system are 120 minutes and 8 customers, respectively. Using one hour as the unit of time determine the A. average expected customer's arrival rate, A. B. average service rate C. the utilization factor p of the system. Problem 2 Find the critical path, Finish Time, Early Start & Early Finish, Late Start & Late Finish, and slack time for all tasks of the following project given this information. A-3, B-4, C-2, D-2, E-4, F-4, G-6, H-5, 1-2, J-3, K-4, L-6, M-4, N-5 D-2 START 0.2 F-4 G-6 E-4 FINISH A-3 B-4 N.S K-4 L-6 1-2 H-S M-4 J-3 Problem 3 Find the shortest path using the Dijkstra's algorithm model for the following given information of this network. 2 2 7 5 5 O B D 4