Perform DFS,BFS,UCS for vertex list and adjacency matrix input with recursion and stack+while loop

Given the undirected graph G1 represented as vertex-list:
Perform DFS using stack for search and function call recursion. (1pt)
Perform DFS using stack for search and (stack + while loop) to replace recursion calls. (1pt)
Perform BFS using queue for search and function call recursion. (1pt)
Perform BFS using queue for search and (stack + while loop) to replace recursion calls. (1pt)

few more