$1.$ In an autonomous car racing game, cars are placed in such a way that there is minimum distance

between any two cars is greater than pre$-$defined minimum distance d$.$ In this race two

autonomous cars $($Xi and Xj$)$ are supposed to locate each other. They have to dynamically decide

their pair. The cars those will meet first will win the race. Can we use bidirectional search and

greedy algorithm in this case? How can we model it as a hill climbing search? Discuss algorithm

and analyze in detail. Provide design diagram, analysis and pseudo code.