Problem 1.1. Please show all work
(use picure please the translation wasnt accurate)
Problem 1.1. Let f be a bijection from a finite set X to itself. Let f2 denote f o f and f3 denote f o f o f, etc. Write f1 for the inverse function of f. Write f2 = f1 o f1, f3 = f1 o f1 o f1 etc. Define f' = Id. Prove that fa+b = f" o fb for all integers a, b.