Computer Science Suppose A ≈PPT B and let f be a function computable in probabilistic polynomial time on the (shared) domain of A, B. Show that f(A) ≈PPT f(B), where f(X ) denotes the distribution...

Suppose A ≈PPT B and let f be a function computable in probabilistic polynomial time on the (shared) domain of A, B. Show that f(A) ≈PPT f(B), where f(X ) denotes the distribution which arises from applying f to samples of X . Does the statement from the previous exercise hold even if f is not efficiently computable? Prove or give a counterexample