<p><strong>Please create code in C++ based on the followinginstructions. The code must implement all 3 graph algorithms!(Breadth First Search, Depth First Search, and Topological Sort).Also the input must be read
<p>JAVA</p><p>Sorting<br/>Why would we want a sorted list?<br/>A new class that implements Comparator, which has a method compareinside<br/><br/><br/>Simulation<br/>Simulation is when a program simulates a real-world problem<br/>Be able to give an example<br/><br/>The
<h3>Question Description</h3> <h3>Description (and Step by Step)</h3><p>this assignment should be a fully-developed 1,000 – 1,200-word Rogerian Argument. This essay draft should include the following steps:</p><ol><li>An introduction that clearly identifies both