Data Structures and Oblects Migterm Part lll. Code trace. 20 points. Show all output Stack a boot bearch(int datal),Int nftens, int key) 4 int lowso,mid,highsnitems-1 6 while (low high) ( 7 mid (low + high) / 2 s push(mid) 10 if (key>data(mid]) Low mid+ high mid else 12 13 14 15 16 if (key data[Low]) 17 return true; 18 else 19 return false 21 22 int main (void) 23 int num,data() (3,5,10,15,16,19,23,37) 24 25 if (bSearch (data,8,19)) 26 cout