4. (15 points) Suppose there are two types of professional wrestlers: "Babyfaces" ("good guys") andetNotpd "Heels" ("bad guys"). Between any pair of professional wrestlers, there may or may not be a rivalry. he Suppose we have n wrestlers and we have a list of r pairs of rivalries File Edit Format View Help (c) Implement: Babyfaces vs Heels in C, C++ or Python. Name your program wrestler and include y instructions on how to compile and execute your code in the README file 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 A V B Y CX D W E Z E Y 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 wrestler1.xt Notepad Sample Output Yes possible Babyfaces A 8 C D E File Edit Format View Help Bear Maxxx Killer Knight Duke Samson Bear Samson Bear Duke Killer Bear Samson Duke Killer Duke Maxxx Knight Impossible