Sectiоn 1 - Greedy A hоspitаl is аttempting tо reduce the totаl time patients spend completing a diagnostic procedure. Every patient must complete the following four stages, in the given order: $$boxed{textbf{MRI Scan} rightarrow textbf{Radiologist Review} rightarrow textbf{Physician Consultation} rightarrow textbf{Discharge}}$$ The hospital owns only one MRI machine. As a result, only one patient can undergo an MRI scan at a time. Once a patient’s MRI scan has finished, the patient immediately proceeds to the remaining stages. There are many radiologists available to review scans, enough physicians to conduct consultations, and multiple staff members handling discharge paperwork. Therefore, any number of patients may simultaneously complete the final three stages. For patient i, let mi = time required for the MRI scan, ri = time required for the radiologist to review the scan, ci = time required for the physician consultation, di = time required for discharge. Suppose patient i begins the MRI scan only after several other patients have already completed theirs. Let Wi = ∑k before i mk denote the amount of time patient i waits before entering the MRI machine. The total completion time for patient i is therefore Ti = Wi + mi + ri + ci + di. The completion time of the schedule is defined as the earliest time at which every patient has completed all four stages and has been discharged. Equivalently, the goal is to minimize maxi Ti. Assume that all processing times are known in advance and are perfectly accurate. Answer the following 5 questions based on this description.