You are given the task of implementing either bfs or dfs for a wide graph. which algorithm
would be ideal for low space utilization? what about a deep graph where solutions are not
common? explain.

Someone plzz me which of these defines a social search? a. asking a search engine a question that is answered by a real person on the other sideb. modifying search results based on popularity of a web pagec.modifying search results based on a ranking of a web page