10:50 AM Mon Feb 18 71% vimt.uta.edu f6 (11 pts) a) (5 pts) Insertion sort is stable. However a simple modification can render it unstable. What is that modification? Write that line of code (preferably), or be very precise in your explanation. b) (6 pts) In class we used a loop invariant (for the outer loop) to prove correctness of insertion sort. State that loop invariant. You do not need to prove the correctness Q2 (15 pts) No justification needed a) Mark all answers that are correct "Being stable or not is a property of ". A) arrays Bsts C) sorting algorithms D) binary search E) none of the these b) Is this expression fully parenthesized? ((4-5)+2)-7) True/False. c) g(N0 (lg(N True /False d) Selection sort is stable. True /False e) What is the for the following summation? 1+3+...+(3)+...+(3)N) A) Ig(N) B)3 C) D) none of the these