I need ans all parts with complete solutions

Question No.1). a. Adjacency matrix is suitable for dense graph, adjacency list is suitable for sparse graph, why? [2marks] b. Which graph representation is efficient for finding neighbors, why the other is not efficient? [2 marks] c. Which graph representation is efficient for finding if a node is adjacent or not, why the other is not efficient? [2 marks] d. Why does Breadth First Search algorithm use Queue for traversal? [2 mark] e. Why do we need to mark the node as visited during graph traversal? [2 mark]