<p><img alt="1. (30 pts) Bidirectional breadth-first search is a variant of standard BFS for finding a shortest path between two vertices" src="https://media.cheggcdn.com/media%2Fd79%2Fd7971dee-4429-4535-a13b-1d5d2b050bc1%2FphpLmmCyL.png" style="height:576px;width:823px;" aria-describedby="d3f"/><img alt="(b) (5 pts) Recall that in
Ineed help asap please.C++ programming. Please write simple as possibleWrite a C++ programs to:<p>1. Create a classcalled Student with four (4) private member variables, name(string), quiz, midterm, final (all double