(1) I will leave this project, which must be based on this pseudo-code for constructing Eulers path, open to your imagination in terms of input/output and ultimate objective. The task it to implement this pseudo-code in any language.

Euler-Path (n n matrix A) /Determines whether an Euler path exists in a connected graph with /o loops and adjacency matrix A Local variables: integer total umber of odd nodes so far found integer degree the degree of a node integer i,j /array indices total = 0 ni while total