2. Consider the following relational schema: APPOINTMENT(DoctorID, DoctorName, PatientID, PatientName, InsurancePlan, InsuranceType, Date, Room) Each tuple in a relation state of APPOINTMENT represents a patient's appointment with a doctor on a particular date. Each doctor has a unique ID, as does each patient, but doctors' names and patients' names might not be unique. Each patient has just one insurance plan, but many patients may have the same insurance plan; every insurance plan has a type. When a patient makes an appointment with a doctor for a particular date, that appointment is assigned to some examination room. The functional dependencies in APPOINTMENT are DoctorID DoctorName PatientID PatientName, InsurancePlan, InsuranceType Insuranc ePlan ? InsuranceType DoctorID, PatientID, Date Room a. APPOINTMENT has only one candidate key. What is it? b. Construct a decomposition of APPOINTMENT into a collection of schemas in BCNF that has the lossless join property. Use the algorithm given in class, and show your work