Given an array of n integers, return the average number of comparisons that would be required to successfully find an element in the array using binary search. You may assume that the values in the array will be provided in ascending order. When more than one element can be chosen in the search, choose the element with a smaller value.

step-by-step explanation:

well if you round, things become much more simple. round 5.95 to 6, 4.25 to 4, and 1.05 to 1. now, add 6+4+1 and that would equal 11. so the items together would equal to about $11.

d will be the best answer

step-by-step explanation:

total income = price of one ticket   *   number of tickets sold

  y                 =     4                                   x

so the equation is y=4x     with x≥0   because number of tickets sold can not be negative

thus the equation is a semi -line with an end point at

(0,0)

passing through :

x=1     y=4(1) = 4   so through (1,4)