please solve the 4th question

Problem 4 (8 marks) Let N = 4* - 1, and let A be an array of size , where each element is an integer in the range [0, N3). You can assume all N integers are distinct. Give an O(N) time algorithm to construct a (2,4) tree with N keys, where each key is an element of A. You must argue for the correctness of your algorithm and present an analysis of the running time. You will get no credit for any algorithm whose running time is w(N). Problem 5 (8 marks) Given an weighted, undirected graph G=(V, E) in adjacency-list representation, a source