C++ Discrete Strucs

read in the number of nodes and a binary relation representing a graph. you will create an adjacency matrix from the binary relation. Then print the adjacency matrix and tell whether or not an Euler path exists. There will be no more than 10 nodes, and you must use a 10X10 2D array for the adjacency matrix. Helpful Note: There is no reason to store the binary relation. Just create the 2D array as you read (so no getline into a string that you then parse). Second helpful note: There are no spaces in the binary relation. Note also that the numbers could be two digits since 10 nodes is possible, so I would read the numbers as ints and the 400's as chars. Sample Run liusta sample run code should work given different input (e.g nodes and binary relation)) How many nodes are in the graph? 6 Please input the binary relation for the graph: (1,2),(1,5),(2,1), (2,3), (3,2), (3,4),(4,3),(4,5), (5,1), (5,4) The adjacency matrix is: 0 1 0 0 1 0 101 000 01 01 100 0 0 1 0 1 0 100 100 0 0 0 0 0 0 An Euler path does exist in the graph