Question 2 1 pts Consider the following algorithm: function Choose $(n \in\{0,1,2, \ldots }, k \in\{0,1,2, \ldots\})$ if $k=0$ or $k=n$ then return 1 else return Choose $(n-1, k-1)+$ Choose $(n-1, k)$ Precondition: $k \leq n$ Postcondition: Choose $(n, k)=C(n, k)=\frac{n !}{k !(n-k) !$ Which of these would be a good way of proving that the Choose algorithm is correct? By induction on $n$ By induction on $\mathrm{k}$ By contradiction By contraposition CS.JG.040