a) Fill in the missing gaps in the text below about data structures in C: "It is possible to maintain the contents of a (A) list if we keep track of its (B) pointer. We can make the (C) bigger without having to invoke (D). Storing a (E) (F) requires relatively (G) memory than an (H) with the same number of (1) because each of its elements is stored as the combination of (J) and a (K)