You have been asked to implement the software for a large company's employee database. The database should store the employees' names, employee id's, their roles, salaries, holiday allowances etc. The company has a huge number of employees but a low tunover (employees rarely join or leave). However on a day-to-day basis a large number of employee records need to be looked up, checked and revised. Discuss the sequential data structure that yu would choose to ensure that the average processing time over a month is as low as possible. When you have decided how the data structure should be arranged, think about the resources you need for adding, deleting and looking up an item. State which operations (out of adding/deleting/looking up) take the most or least time, suggesting a Big Oh estimate for each relative to the ar- rangement of data you have selected