Design an algorithm to search an infinite graph which follows DFS $($Depth First Search$)$ and BFS $($Breadth First Search$)$ in alternate steps. Explain the time and space complexity of the proposed algorithm. Execute the proposed algorithm on a finite Graph given in figure $1.$