Exercise 1.
Write a class implementation for an undirected graph ADT
using adjacency matrix structure. An example graph that
needs to be represented is shown in Question 2 in
Homework 14. You can assume that vertices are indexed
from 1 to n with a graph having n vertices.
Exercise 2.
Implement BFS and DFS traversal for answering the
question c and d of Question 2 of Homework 14.