In a town, there are n people labelled from 1 to n. There is a rumor that one of these people is secretly the town judge.
If the town judge exists, then:
- The town judge trusts nobody.
- Everybody (except for the town judge) trusts the town judge.
- There is exactly one person that satisfies properties 1 and 2.
You are given Trust, an array of pairs Trust[i] = [a, b] representing that the person labelled a trusts the person labelled b.
If the town judge exists and can be identified, return the label of the town judge. Otherwise, return -1.
Input: n = 3, trust = [[1,3],[2,3]]
Input: n = 3, trust = [[1,3],[2,3],[3,1]]
**SOLVE IT USING GRAPHS!