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 (a) give pseudocode for 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. (b) what is the running time of your algorithm? (c) implement: babyfaces vs heels in c, c++ or python. name your program wrestler and include compile and executions instructions 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 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 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