Description
so the first algorithm which we are going to study in this uh grid based path planning is U bread first graph Traverse Al algorithm and first we'll apply we'll we'll apply this BSF algorithm to any general General graph with some nodes with some edges and then we'll apply the…