Question 6 (1 point) Choose the best implementation for the following graphs. A graph that has 100 vertices and 4000 edges A graph frequently need to add/remove vertices 1. Adjacency list Adjacency matrix A graph that has 100 vertices and 100 edges 2. A graph that frequently need to add/remove edges