If false please give reason why:

True or False 1) For the next twoparts, look at two pairings X Ly for a stable marriage Instance. for a graph as follows . The vertices to be the people & the edges connect a person p and dogd, if the pair ( pod) is is X or y (or both ) a ) for any cycle in the graph Low two pairgs X & Yeither all the persons in the cycle prefer s or all the persons in the cycle prefer y. 6) If Xisthe person optimal pairing, and & is the dog optimal paining , and the graph of X &y consists of a single cycle then ther are exactly two stable pairings