Let G be a graph with six vertices, v1, v2, v3, v4, v5, v6, and seven edges. Let B be the 7 x 2 edge matrix (or you can use an adjacency list) of G. (Recall that each row of B denotes an edge of G, e.g. the row (3, 4) would denote the edge {v3, v4}.) Write a program or an algorithms (using pseudocode) which prints the degree of each vertex of G. Test the program: B = 1 2 1 4 1 6 5 3 2 4 2 6 4 6

answer in c++