Suppose we are performing a binary search on a sorted vector initialized as follows:Write the indexes of the elements that would be examined by the binary search $($the mid valu algorithm's code$)$ and write the value that would be returned from the search.

Now suppose we are performing both an iterative $($loop$-$based$)$ sequential search and then a $r$ binary search on the same list. The sequential search is a standard version that does not take : advantage of the sortedness of the list, simply looking each element in order from the start to of the list.

Suppose we are searching the list for the value $25.$ Also suppose that we are operating on a sp computer where reading an element's value in the list $($such as examining the value of number costs $7$ units of time; calling any function costs $10$ units of time; and all other operations are e: $0$ cost$.($Keep in mind that even in a non$-$recursive search, the cost of making the one and only binarySearch still counts in your total.$)$ What is the total "cost" of running a sequential sear recursive binary search over this list of data, searching for the value $25?$