for this question one of the tree search methods (DFS or BFS) should be modified as to store paths during the search procedure. Finally, the code must return the direct path as a list of nodes from the root node to the node found.

any programing language would do

but please write a report that includes:

an Online link to see and to run the codes on an online compiler site which has no access problems.

Explanations about the methods/approaches used and the code logic.

Calculations of the worst, best and average case time complexities and final representations using big-O, big- and big- notations.

QUESTION 1- Please write a code that searches for a node in a tree structure. If it finds the node given the code must return all the parent nodes starting from the first node to the node that we found. Signature of the function could be: public class Node \{ public int value; public List children; \} public List getParents(Node rootNode, int valueToSearch, ..) \{ Sample: For instance, if the node 11 is searched in the tree structure below the function must return the node list [2, 7 , 6,11]