Suppose F:{0,1}n{0,1}n{0,1}n is a secure Pseudorandom Function. Check if the following F are also Pseudorandom Functions. Prove your answer in each case, i.e., if F is a pseudorandom function then explicitly show why a distinguisher for F would give a distinguisher for F, and if F is not a pseudorandom function, construct a distinguisher and calculate their distinguishing probability. (a) F(k,x):={F(k,x)ki=1nxi=0i=1nxi=1. Here k,x{0,1}n and k denotes the ones complement of k, i.e., the string obtained by flipping each of the bits in k. (b) F:{0,1}n{0,1}n1{0,1}2n is defined by F(k,x):=F(k,x0)F(k,1x), where k{0,1}n and x{0,1}n1