1. Find an image of an object, for example: 2. On the image, identify a minimum of 7 points or vertices. For example: 3. Draw a connected graph based on these vertices using a minimum 7 edges. Label the vertices with letters from your name. Remember each graph in the class must be UNIQUE. A duplicate will be rejected. 4. Write your set of vertices and edges as below: [3 marks] V={E={}} 5. Draw its Adjacency Matrix [3 marks] 6. Draw its Adjacency List (3 marks) 7. Show a traversal of the graph both traversal methods [8 marks]: - Breadth First Search (BFS) - Depth First Search (DFS) For both algorithms, you need to show the steps and draw the resultant BFS Tree and DFS Tree respectively