Whatever is you answer in part a, prove it using the fastest method between a counter example, a proof by contradiction or a proof by induction.

What you need to do: Answer the questions and/or solve the exercises described below. Exercise I (15 points) Consider this algorithm Mid(a,b): Input: two integers a and b Output: an integer that is the midpoint between a and b. Example: Mid(4,10) 7 Mid (a,b) m(a b) >>1 return m a) (5 points) Is this algorithm correct? (Answer only Yes or No) b) (10 points) Whatever is your answer, prove it using the fastest method: a counterexample. A proof by contradiction, or a proof by induction