If we wanted to find the value (1 or 0) of the third bit from the right (bitNum = 2) of variable x, we should: O int bit = x & 4; int bit (x >> 3) & 1; O int bit =x >> 3: O int bit (x >> 2) & 1;

Not pseudocode Suppose the economies of the world use a set of currencies C1, . . . , Cn; think of these as dollars, pounds, Bitcoin, etc. Your bank allows you to trade each currency Ci for any other currency Cj, and finds some way to charge you for this service. Suppose that for each ordered pair of currencies (Ci, Cj ), the bank charges a flat fee of fij > 0 dollars to exchange Ci for Cj (regardless of the quantity of currency being exchanged). Describe an algorithm which, given a starting currency Cs, a target currency Ct, and a list of fees fij for all i, j ∈ {1, . . . , n}, computes the cheapest way (that is, incurring the least in fees) to exchange all of our currency in Cs into currency Ct. Also, justify the its runtime. [We are expecting a description of the algorithm, as well as a brief justification of its runtime.]

1. Prof. Nigma at the Portland Institute of Technology (which still doesn't exist) was thrilled with your previous work and hired you again to analyze the algorithm given here in pseudocode! As usual, however, Prof. Nigma neglected to explain what the algorithm does. def Q(A[0..n - 1]) // Input: Array A[0..n-1] of n real numbers, for n ≥1 if n = 1 return A[0] else temp = Q(A[0..n - 2]) if temp ≤ A[n 1] return temp else return A[n - 1] (a) What does this algorithm compute? Give an English description of what value it returns on a given input array, along with a convincing explanation of your answer. (You do not need to give examples as part of your answer, but as always, you are welcome to include examples along with the English description, if it would make your answer clearer.) (b) What is the complexity class of this algorithm? To find it, first state a re- currence for the time complexity of the algorithm, then solve it using one of the methods presented in class for solving…

Python