Question-1 : For the following situation: (a) Represent it with adjacency list representation. (b) According to your representation in part- a, is it a sparse graph or dense graph(c) What is the...

Question-1 : For the following situation: (a) Represent it with adjacency list representation. (b) According to your representation in part- a, is it a sparse graph or dense graph(c) What is the memory requirement for this case? (d) Represent the part-c in general asymptotic notation (e) If you have represented it in adjacent matrix representation, what will be your worst time complexity for a quick edge search time? [Hints: you can write it in a single word like O (answer).] (f) If you have represented it in adjacent matrix representation, will it be a Sparse or Dense graph? Why? What's your logic?