A media company has been provided with pairs of advertisements that are to be played one after the other. These advertisements are denoted by uppercase letters from the English alphabet. To maximise the revenue, the media company is in need of software that will provide an insight into which arrangement should be selected so that every advertisement is played at least one time. The software will take advertisement pairs as an $14$ M gnd in which every row will denote the pair of advertisements that need to be played one after the another, and will return the arrangement is which every advertisement will be played at least one time. As per the prior analysis, the media company found out that if the arrangement starts from "ABIC advertisement then maximum revenue is generated. If more than one way is possible, then the software will give the smallest lexicographical arrangement

Write an algorithm for the software to help the media company find the maximum revenue that can be generated such that every advertisement is played at least once. If more than one arrangement is possible then give the smallest lexicographical arrangemen