$8.(4$ points$)$ Hill$-$Climbing SearchThe hill climbing search algorithm is simply a loop that continually moves in the direction of increasing valuethat is$,$ uphill. It terminates when i reaches a "peak" where no neighbor has a higher value. Hill climbing is sometimes called greedy local search because lt grabs a good neighbor state without considering where to go next, The success of hill climbing depends very much on the shape of the state$-$space landscape. Although greed is considered one of the seven deadly sins$,$ lt turns out that greedy algorithms often perform quite well.$($a$)$ Which algorithm you learned is similar to this hill$-$climbing search algorithm?$($b$)$ What are the drawbacks of this hill climbing search algorithm?$($c$)$ What are the solutions to these drawbacks?$($d$)$ What does it mean:"The success of hill climbing depends very much on the shape of the state$-$space landscape."