An array is sparse if most of its entries are null. A list L canbe used to implement such an array, A, efficiently. In particular,for each non null cell A[i], we can store a pair (i,e) in L, wheree is the element stored at A[i]. This approach allows us torepresent A using O(m) storage, where m is the number of non-nullentries in A. Here is an array list ADT for your reference:size(),isEmpty(), get(i), set(i, e), add(i, e), and remove(i). Describeand analyze efficient ways of performing the methods of the arraylist ADT on such a representation. Hint: There isa trade-off between
PayPal Gateway not configured
PayPal Gateway not configured