(15 pts) Given a graph and a node u of the graph, find the number of nodes connectable from u. Two no To find the number of nodes connectable from u, your algorithm must use depth first search idea discus used in class, and make your problem decomposition (divide and conquer) very clear (e.g., by com Algorithm 1 input outpat 1 side effect plan end Algorithm (Function Name: Input Output Side effects Plan (15 pts) Given a graph and a node u of the graph, find the number of nodes connectable from u. Two no To find the number of nodes connectable from u, your algorithm must use depth first search idea discus used in class, and make your problem decomposition (divide and conquer) very clear (e.g., by com Algorithm 1 input outpat 1 side effect plan end Algorithm (Function Name: Input Output Side effects Plan