Please provide an inductive proof and informal proof to prove program correctness.

Search (IncreasingList, Key){//Key might not be in list Int a = 0;//lower bound Int b = IncreasingList.length-1;//upper (-1) While (a Key)//too far b = i - 1; Else/ot far enough a = i + 1; } Return-1;//-1 denotes no Key in list