0 3 one 10 Concatenated Adj. List is 2 way of storing graphs. It puts all adjacency lists into array f uses NULL character (4) as boundaries. For graph shown here, the CAL will be 1,3,2,4, Q, 2,1,0,3,1,0,4,1,1,5, @ Write cote that will convert CAL to Adj. Matrix. A graph has n verts e medges. How many cells will its CAL hare? Give 2 reasons why you will not prefer to use CAL. What's the complexity of checking if uf v have on edge using CAL? Justify