if the list in the accompanying figure was to be searched for the number 44 using a binary search, how many key comparisons would have to be made?

im alright what do you need

step-by-step explanation:

, and

for

step-by-step explanation:

we can analyze the pattern at which the terms increase. let us denote , , , so that we can call

note the following:

the pattern: to get the next term value, we just add the next term number (e.g. 1st, 2nd, to the previous term value (term values are the given numbers in the question, 1, 3, 6, 10, 15,

from , to get to , we add

from , to get to , we add

etc.

we need to form a recursive formula, a formula that has the next term as a function of the previous term. so a possible recursive formula can be

, and for

sample answer: you can determine whether each element of the domain is paired with exactly one element of the range. for example, if given a graph, you could use the vertical line test; if a vertical line intersects the graph more than once, then the relation that the graph represents is not a function.

answer is c

step-by-step explanation:

81/12=324/x

x=48