c3=-1 , c4=10 , c5=6

Question 1. (30 pts) Suppose you would like to design a pseudocode for teaching how to play X. What would be the primitives that you would need to describe a(n) X game? In particular, describe the syntax and semantics of primitives that you would use for playing X X Football, if your student ID is even X Basketball, if your student ID is odd Question 2. (30 pts) For the following list of values: [O] [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] 5 7+c5 21 30+c3 40 46 51 60+c4 101 104 108 a. How many comparisons does it take using binary search to find the following values or determine that the item is not in the list? (6,31, 55, 108) b. What is the average, best-case and worst-case complexities of binary search algoritm in big-theta notation? Give numerical examples for each case