Logic : Iterate through each candidate and check the locked matrix. If there is no candidate

such that locked[i][winner] is true, then that winner is the source of the graph and should be printed. Visualizing the Preference Graph

: To ensure the "strongest" preferences are considered first, sort the pairs array in descending order based on the "margin of victory" (the number of people who prefer the winner over the loser). 3. The Locking Logic (Avoiding Cycles)