Question 6 Consider the following database Schema, where patients can have many appointments in different hospitals. Hospital (HNo Hname) Patient (PID, Pname) Appointment (HNO, PID, ApptDate price) Based on the following assumptions: 10 tuples in Hospital; 50 tuples in Patient; 100 tuples in appointments; 5 appointments for Patient ID=555 no indexes or sort keys; results of any intermediate operations stored on disk; cost of the final write is ignored; tuples are accessed one at a time. Calculate the cost of the following strategies to retrieve the list of appointments for patient ID=555, and show which one is more efficient. 1. O PID=555 ((Hospital * Appointment) * Patient) 2. Hospital * (Appointment * (o PID=555 Patient)) Question 6 Consider the following database Schema, where patients can have many appointments in different hospitals. Hospital (HNo Hname) Patient (PID, Pname) Appointment (HNO, PID, ApptDate price) Based on the following assumptions: 10 tuples in Hospital; 50 tuples in Patient; 100 tuples in appointments; 5 appointments for Patient ID=555 no indexes or sort keys; results of any intermediate operations stored on disk; cost of the final write is ignored; tuples are accessed one at a time. Calculate the cost of the following strategies to retrieve the list of appointments for patient ID=555, and show which one is more efficient. 1. O PID=555 ((Hospital * Appointment) * Patient) 2. Hospital * (Appointment * (o PID=555 Patient))