a. i. Explain how the array data structure may allow the MIS to be created in Ο(n lg n) time. Let n represent the amount

[answerhappygod]

a. i. Explain how the array data structure may allow theMIS to be created in Ο(n lg n) time. Let n represent the amount ofstudent records to be stored. [2 marks] ii. Explain how the arraydata structure may permit the retrieval of any student’s record inΟ(lg n)time. [2 marks] b. Recommend, and justify, ANY OTHER datastructure that may permit the creation and retrieval of student'srecord in a time that is more efficient than an array datastructure. [4 marks] Outline, with the use of an example, theappropriate uses for EACH of the given asymptotic notations (seeBackground). [9 marks] . a. Give the pseudo-code algorithm for thequick sort, and ANY OTHER TWO sort algorithms. [6 marks] b. Usingthe Ο-notation, give the execution time for all pseudo-codealgorithms in 5 part a. Show ALL working. [6 marks] c. Based on theanalysis done in 5 part b, recommend a sort algorithm forimplementation and use within the MIS. [1 mark]