10 16 points Consider an ambulatory surgery center having 4 ORs. Any OR can be used for any type of surgery performed in the center. Surgery requests arrive into the scheduling office of the surgery center, sequentially. When a request arises for a surgery, the surgery is scheduled into an OR without considering the impact of possible future surgery requests. These surgeries are considered for the morning shift of the surgical suite. Therefore, assume that ORs are open for 4 hours during regular time. However, 30 minutes of overtime is also allowed in each OR. Below you can find the expected durations of 10 surgeries that request the same day. Note that the index of a surgery represents the arrival order of the surgery request. Suppose that the manager decides to solve this allocation problem using worst fit heuristic. How many ORs does the manager need according to worst fit heuristic? Which surgeries are allocated to which ORs according to the heuristic? Show the application of the heuristic clearly. index duration 1 250 2 90 3 120 4 140 5 40 6 7 8 9 10 100 180 80 110 150 Dragn' Drop here or Browse 4 points Note that your solution for the previous question will indicate that the manager needs more than 4 ORs even though the surgery center has only 4 ORs. Apparently, the solution is not feasible. However, the manager mentions that she is not willing to use any scheduling rule other than the worst fit. Then, which controllable parameter needs to be changed by the manager to obtain a feasible schedule for the ambulatory surgery center? Turnover time Planned overtime Waiting time Patient arrival time