Madify the tiray searh alpoithn in the attached file so seant the waned peive found prin the insion of the boik, neveruier print mot fiend Binary Seareh is a search aigorthm that in wsed to And the position of an elentent (target value ) in a sorted array. The array should be sorted prior to applying a binary seinch. Binary search is also known by these names, logarthmic search, binary chop, half intorval search. Working The Einary seach algorehm works by compering the element to be searched by the middle element of the aray and bssed on this comparison follows the requlred proceduen. Case 1 - element = middle, the elemeet is tound retum the index. Case 2 - deemsin > miagle, search for the elewert in the sub-aray starting from midde+1 index to n. Case 3 - element & middle, sarch for element in the subaryy ataring from 0 index to migde - 1 . ALGOPITHM Parameters inital_value, end_value Scep 1 z find the niddle telense. of array. using, middle - inital value + end_valse 21 sicep 2 i if niddle = elecitic, retwrn 'elenent found' and indest step 3 in if middth > elwoent, cull the tutiction with and value = midali= 1. seep 4 z if miditie o ejenent, eall the function with atart value o midale + I . step 5 a trits. The implementation of the binary search algortthm function usest the call to function again and again. This call ean be of two types - therative - Recoursive Herative eall is looging over the same block of code mutiple times 1 Pecuraive call is ealieg the same tunction again and again. PROGRAM TO IMPLEMENT BINARY SEARCM USING ITERATIVE CALL Example Exwasione inelask situla,h> int itesat iveBinaryenth (itht drtay[), int start_ Iedexi. the end_15dex. Ift eleeent. while istate_inden wn enalindecli 1st ntdeln - atart_Ifidex lent_itrdex-atart_inden irrh If tarrayinididle eltenecit retern ndddle! If iafrayiniddie o eimest] srart_fobex - madat o It sid_Index = madale = If int nuknirosdi! int.i=11 int oldenent - 163 Int foind indwx = iterat: ivelinarydeareh carray, 2= t. 2 wdenent f ? if iforote indin x=1 in if