Here is a distinguishing algorithm for a black box that has either a random permutation f: Z100 Z100 or a random function f: Z100 Z100. Distinguisher(f): X = f(0) y = f(1) if (x==y) output "func" else output "perm" Put a checkmark next to each valid formulation of adversarial advantage. Pr[output "func" |f is a random function] - Pr[output "func" |f is a random permutation] Pr[output "perm" | f is a random permutation] - Pr[output "perm" | f is a random function] Pr[output "perm" | fis a random permutation] - Pr[output "func" | f is a random permutation] Pr[output "func" |f is a random function] - Pr[output "perm" |f is a random function]