Departments, identified by ID, operate a variety of printers, each located in a particular room in a particular building. Printers are supplied by a number of suppliers, identified by name, with each supplier charging a different price for a given printer, but also providing different delivery delays, measured in days. A given room can have any number of printers, including none. The relation and FDs are given below. Printing Service (DID, Printer #, Room#, Building#, Supplier Name, FDs: Supplier Address, Delay, Cost) Printer #DID, Room#, Buildign#, Supplier Name (Room#, Building#) DID (SupplierName, Printer#) Delay, Cost - Suplier Name Suplier Address a) Find all the candidate keys for the relation. b) Indicate which FD(s) violates BCNF. c) Find a BCNF decomposition for the given relation. d) Is your decomposition lossless? e) Does your decomposition preserve all functional dependencies?