Question 2Solve the following linear programming model using the Simplex method:MaxZ=8x110x2Such that:x1x242x2=63x1x29x1,x20Question 3A company runs taxicab service to the neighbouring community. At any given time customers call a dispatcher to demand service indicating their locations. The dispatcher assigns the taxicabs to customers to minimise total time to reach the customers, using software based on the assignment method. Currently, there are 3 customers who have called for service and the dispatcher currently has four taxicabs available. Table 1 shows the minutes it will take for each taxicab to reach the customers at their current locations.Table 1\table[[,Customer],[Taxicab,A,B,C],[1,2,4,10],[2,1,5,6],[3,7,6,6],[4,5,2,4]]Use the assignment method to:i) Determine one set of optimal assignment of taxicabs to customers.ii) Determine a second optimal assignment, if any.iii) Determine the total minimum time involved in the optimal assignment.2