chap lists and arrays revisited (aa (bc (cfigure some example multilists exercises for each of the following bracket notation descriptionsdraw the equivalent multilist in graphical form such as shown in figure (ahabhcdeihfhgihii (bhabhcdl eil (chl al hl bil hl ii (ashow the bracket notation for the list of figure ( (bshow the bracket notation for the list of figure ( (cshow the bracket notation for the list of figure ( given the linked representation of pure list such as hx hy hz iy ihw ix iwrite an in-place reversal algorithm to reverse the sublists at all levels including the topmost level for this examplethe result would be linked representation corresponding to hx hw ihy hz iy ix what fraction of the values in matrix must be zero for the sparse matrix representation of section to be more space efficient than the standard two-dimensional matrix representation when data values require eight bytesarray indices require two bytesand pointers require four bytes write function to add an element at given position to the sparse matrix representation of section write function to delete an element from given position in the sparse matrix representation of section write function to transpose sparse matrix as represented in section write function to add two sparse matrices as represented in section