You are given two candidate PRPs, P and P, each with keyspace {0,1} and over the domain {0,1}. You know for sure that both P and P implement permutation families, i.e. for each k{0,1} it holds that both P(k,) and P(k,) are permutations on {0,1}, but you dont know for sure whether they are PRPs. Construct a permutation family Q over {0,1} such that Q is an PRP as long as at last one out of P and P is an PRP