Let A and B be sets and let f:A→B be a function let h:P(B)→P(A) which
defined by h(Q)=f-1 (Q) for all Q€P(B).Prove that h is injective if and only if f is injective

Drag each tile to the correct box. not all tiles will be used. consider the recursively defined function below. create the first five terms of the sequence defined by the given function