this question is a bit chalenging. please help and answer all 3 parts correctly. last time asked it was incorrect so please do not refer to that or thumbs down. please give good and correct answer for thumbs up :))

Consider a system where we monitor the performance of an airport luggage system. The main table is Luggage(bagid, tht, wgt, desk,date, eid) Each row of this relation needs 64 bytes. This includes the 4-byte primary key bagld. There are 1,200,000 rows in the table. The occupancy load factor is 70%. This means that each page is 30% free. The database uses 1192 byte pages to storing both data and indexes. We earmark the first 200 bytes of each page for header data, We assume that records and index entries may not cross over pages. a) How many 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 imvolve searches over "desk", such as the following: SELECT COUNT(*) FROM Luggage WHERE desk = 'United' AND wgt > 25; 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