(15 pts) Given a graph and a node u of the graph, find the number of nodes connectable from u. Two nodes are connectable if there is a path between those two nodes. To find the number of nodes connectable from u, your algorithm must use depth first search idea discussed in the class. Note you must follow the algorithm format used in class, and make your problem decomposition (divide and conquer) very clear (e.g., by comments). Algorithm 1: input output : side effect: plan 1 2 3 4 5 6 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 nodes are connectable if there is a path between those two nodes. To find the number of nodes connectable from u, your algorithm must use depth first search idea discussed in the class. Note you must follow the algorithm format used in class, and make your problem decomposition (divide and conquer) very clear (e.g., by comments). Algorithm 1: input output : side effect: plan 1 2 3 4 5 6 end Algorithm (Function) Name: Input Output Side effects Plan