The objective of this exercise is to find a way of assigning supervisors to sections in order to minimise total inefficiency . Use the assignment method to determine the optimal assignment and the total inefficiency . Determine any other optimal assignments [10] b . The servicing time of car at a repair shop can be described by a discrete random variable x (Table 7). Table 7 Servicing Time in Days Probability (x) P(x 3 0.10 0.50 0.25 0.15 1 . Develop a random process generator for the car servicing time [4] With a seed value of 37, a constant multiplier of 17 and modulo of 83, use the Multiplicative Congruential technique to generate $ random numbers [2] ifi Simulate the next eight servicing times based o on the random numbers and process generator [5] ifi. Find the mean time spent servicing a car at the repair shop and the 95 % confidence interval of the mean [4] Question Solve the following Integer Programming (IP ) model using the branch and bound method (use the graph sheet provided ): Max Z = 3X1 + 5X1 Such that : 2X , + 4X, $ 26 3X ] + 2X, $9 X1: X2 20 and integer [20] Q 6b i. What is meant by dynamic simulation model ? [2] ii. Explain what is an infeasible problem in linear programming ? [1.5 ]