Using the adjacency matrix for EmployeeGraph from Exercise 12, describe the path from Susan to Lance 

1. using a breadth- first strategy. 

2. using a depth-first strategy.

 Exercise 12

Extend the class GraphType in this chapter to include a Boolean EdgeExists operation, which determines whether two vertices are connected by an edge. 1. Write the declaration of this function. Include adequate comments. 2. Using the adjacency matrix implementation developed in the chapter and the declaration from part (a), implement the body of the function.

EmployeeGraph V(EmployeeGraph) E(EmployeeGraph) = (V, E) {Susan, Darlene, Mike, Fred, John, Sander, Lance, Jean, Brent, Fran} = = {(Susan, Darlene), (Fred, Brent), (Sander, Susan), (Lance, Fran), (Sander, Fran), (Fran, John), (Lance, Jean), (Jean, Susan), (Mike, Darlene), (Brent, Lance), (Susan, John)}