Our basic algorithms-for-non-theorists graduate class mostly covers graph algorithms, dynamic programming, linear programming, approximation, and NP-completeness. I think the specific…