Example: P Request (1,0,2) • First, we Check that Request < Available (that is, (1,0,2) ≤ (3,3,2)→> true) Allocation Need Available Allocation ABC ABC ABC Max Available ABC ABC ABC Po 010 753 332 Po 010 743 230 322 P₁ 200 P₂302 P 211 902 P₁ 302 222 P 002 433 P₂ 302 600 P3 211 011 P4 002 431 • Second, We must determine whether this new system state is safe. So, we execute our safety algorithm and find that the sequence satisfies the safety requirement. • Can request for (3,3,0) by P4 be granted? no, (2,3,0) < (3,3,0) 020

Question 2: The game of "FastestPath" consists of a path (a 1-D array) with n positive integers to represent n cities in a path (except the first index which has always value 0). The aim of the game is to move from the source city (located at index 0) to destination (located at last index) in the shortest time. The value at each index shows the travel time to enter the city located in the corresponding index. Here is a sample path where there are 6 cities (n is 6): |0 5 |90 | 7 61 | 12 Always start the game from the first city and there are two types of moves. You can either move to the adjacent city or jump over the adjacent city to land two cities over. The total travel time of a game is the sum of the travel times of the visited cities. In the path shown above, there are several ways to get to the end. Starting in the first city, our time so far is 0. We could travel to city 2, then travel to city 4, then travel to last city for a total travel time of 90 + 61 + 12 = 163. However, a…

Let A = {4, 3, 1, 4, 12, 3} and let B = {5, 2 · 6, 2, 4 - 3, 4}. a) |AUB| = b) |AnB| = c) |A – B| = d) |B – A| =

def mystery (1st); for idx in range(1, len(1st)); tmp = 1st[idx) idx2 = idx while 1dx2 > 9 and 1st[idx2-11 tmp: 1st[idx2] 1st[10/2 - 11 1dx2 = 1dx2 - 1 1st[idx2] = tmp print(1st) a. If we call this function as follows: mystery(lt) where ist 15, 2, 8, 11, what is printed out t clear about what is printed out, don't make me try to figure it out). b. What does this function do? c. What is the complexity of this function? Oni Ora, On³ Ologinil, Onioginil? Explain your reasoning