The isLegal method is designed to determine whether a set of three strings representing playing cards contains exactly one occurrence of each of the following cards: "Jack", "Queen", and "King". The parameters a, b, c are three strings representing playing cards. Each string may contain the rank of Cards. This method returns true if exactly one occurrence of each of "Jack", "Queen", and "King" is present among the input strings, and false otherwise.