write an iterative function pathExists which returns true

6. Graph Search (3 points) Suppose we define a graph node as follows struct for a single node in a graph. info contains the data visited and is 1 othervise * stored in this node. visited is o if the node has not been struct node nt data; int visited typedef struct node node Array of all the nodes in the graph / node ver [NUNNODES) / 2d array representing the adjacency matrix/ int adj ENUMNODES] CNUMNODES! Write an iterative function pathErists which returns true (i.e. 1) if a path exists from the node ver s to the node ver f) and false (i.e., 0) otherwise. You can assume NUMNODES is a global constant (i.e., you can access it from your function). Reminder: ad loi is 1 if there is an edge from the node verlil to the node verb]. A path is a sequence of 1 or more edges. You have access to queues and stacks if want to use them in your implementation. Assume the following: /* Creates a new queue/stack / queue Q getqueue O stack S getStack ( ); Frees queue/stack ./ freequeue() freeStack(S); /* Add element x to queue/stack insert (Q,x); push (S, x); Check if queue/atack are empty */ isEmpty(Q) isEmpty (S) /+ Remove element from queue/stack / x remove() r pop(S)