After the tree is populated as described immediately above, execute a set of 10 contains operations 1,000 times, timing how long it takes to complete all 10,000 contains calls. Report out the execution time. Rebalance the tree and repeat the 10,000 calls, and report out how long it takes after the tree has been rebalanced. Be sure to avoid including any I/O in the execution times. Use these values as the actual parameters for the contains calls: 2, 7, 1117, 22307, 33331, 45533, 48611, 4, 24000, 50000

Answer blank(1); ; metadata;                     blank(2) consortium;                     blank (3); quantitative; i pretty sure these are correct, plz check first good luck

Ithink the answer is a

Answer1: 1

Choice 2.the algorithm constantly checks to see if the value in the position before is greater than the value in the current position. if there is even one instance, it will return false and stop looping.using an if-statement without } and { means that the if-statement true condition only applies for the next lineconsider  . the condition  checks if previous position is greater than or equal to current position. if it is, it will make method return false. for that example, it won't.consider  , it would return falseconsider  . it would return false