Verify the correctness of the Selection Sort algorithm (ascending order) using induction. Hint: consider two cases to prove the inductive step:1) The best-case scenario, where the n+1st element of an array is the largest one;2) The worst-case scenario, where the n+1st element of an array is the smallest one and must be moved to the 1st position.