One way to represent a graph is by its incidence matrix, INC. There is one row for each vertex and one column for each edge. Then INC(i, j)-1 graph and its incidence matrix representation is given below, 1 if edge j is incident to vertex i. An example of a V1 V4 V2 V3 Edges Verices 0 0 0 0 0 Incidence matrix A) Write an algorithm for Breadth-First Search that works on a graph represented by its incidence matrix. One way to represent a graph is by its incidence matrix, INC. There is one row for each vertex and one column for each edge. Then INC(i, j)-1 graph and its incidence matrix representation is given below, 1 if edge j is incident to vertex i. An example of a V1 V4 V2 V3 Edges Verices 0 0 0 0 0 Incidence matrix A) Write an algorithm for Breadth-First Search that works on a graph represented by its incidence matrix