4. Consider the following recursive algorithm. Algorithm Mystery A[0..n - 1]) //Input: An array A[0..n - 1] of real numbers if n = 1 return A[0] else temp ← Riddle(A[0..n - 2]) if temp ≤ A[n 1] return temp else return A[n − 1] a. What does this algorithm compute? The given algorithm will recursively calculate the minimum of the given array or list of elements. For every value of n. It calculates the minimum of all values preceding n(ie. <= n- 1). If the value returned is less than the value[n], it returns that value else it returns value[n]. b. What is its input size? Input size: an array of size 0 to n-1 of real numbers. c. What is its basic operation? The basic operation is: temp <- Riddle(A[0...n-2]) d. Set up a recurrence relation for the algorithm's basic operation count and solve it. e. What is the efficiency class of this algorithm?

Explain "user interface." Explain the differences between software GUIs, NUIs, and CLIs.

Using bullet points, please explain the functionality of the boots.

(a) A school is conducting a survey of students to learn more about how they get to school. Students were asked how they travel to school, how long it takes them to get to school, what time they arrive at school, and for a description of their most significant challenges when traveling to school. Several rows of the data collected are shown in the table below. Student ID How Travel How Long Time Arrive Biggest Challenges 738192 Car 10 minutes 7:30 am None 781401 Car 20 minutes 7:45 am 72001 Car 5 hours 7:40 am 74012 Bus 10-20 minutes 7:35 am Sister sometimes sleeps in and I miss my bus Walk 1 hour 75441 7:30 am 73109 Walk 20 mins 7:45 am 76120 Bus twenty minutes 7:35 am 73012 Car 15 min 7:20 am Waking up! Which column of data might be able to be visualized or analyzed but first would need to be cleaned? How Travel B Time Arrive (© How Long O Biggest Challenges