Please answer all 3 parts of the questions! Especially needing a hand in part a. I will give thumbs up if all 3 questions answered. Please READ the question carefully.

Assume we have two relations: Employee (Name, EID, position-number, salary, salary-increase-percentage, year) and Job (position-number, max-average-increase, year). Assume we have a shipment monitoring system at maritime ports. We focus on the following relation: Ship-container(shipld, imvc, wgt, container, date, comp_id) 196 bytes of each page. We assume that records and index entries cannot cross over pages. a) How marry bytes are needed to store just the relation above? Do not include indexes. Make sure you state any assumptions you make. Your analysis determines that most of your queries involve searches over "container", such as the following: SELECT COUNT(') FROM ship-container WHERE container= 'C1' AND wgt > 35; b) What do you believe the database should use as access path to process such queries? Give an estimate of the number of I/O required to process such query. c) Are there other alternatives? What is the effect this would have on the performance