In the uniform cost algorithm, which values are stored in the priority queue for each cell?       f(n)   ,   h(n)   The coordinates ,    g(n)   g(n)   , h(n)   g(n)  ,    f(n)

Please explain n^1000=O(2^n) Choice 1: True 2: False

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…

Moe, Larry and Curly have just purchased three new computers and use three different algorithms to sort lists: Comparisons / sec Search Algorithm T(n) Мое 50 Linear Search n Larry 5 Curly 1 Optimal Chunk Search 2/n Binary Search log2 n where T(n) is the number of comparisons it takes, in the worst case, to sort a list of size n. How large must n be to ensure that, for every list, ... i Curly's computer sorts faster than Moe's? ii Larry's computer sorts faster than Moe's?

Explain the complete work !