Can also give an explanation, please?

Consider the following list. int list[]={4,8,19,25,34,39,45,48,66,75,89,95} when performing a binary search for 75, after the first comparison the search is restrict to list [6]...list[11]

Assume that the list consists of the following elements. What is the result after the first pass of the bubble sort algorithm? Assume the list is to be sorted in ascending order. int list[]={12,56,34,25,73,46,89,10,5,16}