Answer the following questions (b) (i) (ii) (iii) (c) i. ii. iii. iv. State the principal queue parameters Briefly explain the following with an illustrative examples Balking Reneging Jockeying Give a clear example of each of the following as used in queuing theory: Finite Queue length Infinite Queue length Finite population Infinite population (d) Given that the queue formed by students during a medical examinations exercise has a model in the form: 15/17/1: 00/00}. (a) What type of model does {15/17/1:00/00} represent? (b) Find the probability that no student will be available (c) What is the probability that at least a student will be available? (d) What is the probability that there will be no queue.? (e) What is the probability that 9 students will be available? (1) What is the expected length of the system (Ls)? (g) What is the expected length of the queue (La).? (h) What is the expected time of the system (W).? (i) What is the expected time of the queue (W).? Answer the following questions 1. (a) Define the following as used in network models with an illustrative diagrams. A graph Spanning Tree (iii) Minimum spanning tree (iv) State any two theorems used to test for a minimum spanning three. (1) (b) The network (Map) below represents a new District in the Ashanti Region with smaller communities. A contractor wants to network the community with water pipes in such a way that the main pipe passes through each community. Find the minimum length of pipes that he must use to minimize cost, using the Prim's Algorithm. Verify your results with Kruskals Algorithm