How do I solve this, I have a problem understanding the tree search algorithms or functions and all that, can u help me solve this and explain how we did it?

2. Fill in the missing parts in the following TREE_SEARCH function? function TREE SEARCH(problem, strategy) returns a solution or failure Initialize the FRONTIER using the starting state While the frontier is not empty Choose a frontier node to expand according to If the node contains the return solution Else the node and add its children to the