Implement a C++ Program:

Suppose there are two types of professional wrestlers: Babyfaces (good guys) and Heels (bad guys). Between any pair of professional wrestlers, there may or may not be a rivalry. Suppose we have n wrestlers and we have a list of r pairs of rivalries.

Create an efficient algorithm that determines whether it is possible to designate some of the wrestlers as Babyfaces and the remainder as Heels such that each rivalry is between a Babyface and a Heel. If it is possible to perform such a designation, your algorithm should produce it.

Implement: Babyfaces vs Heels.

Input: Input is read in from a file specified in the command line at run time. The file contains the number of wrestlers, n, followed by their names, the number of rivalries r and rivalries listed in pairs. Note: The file only contains one list of rivalries

Output: Results are outputted to the terminal. Yes, if possible followed by a list of the Babyface wrestlers and a list of the Heels. No, if impossible.

Sample Input file:

5 Ace Duke Jax Biggs Stone 6 Ace Duke Ace Biggs Jax Duke Stone Biggs Stone Duke Biggs Jax

Sample Output: Yes Babyfaces: Ace Jax Stone Heels: Biggs Duke