17 There is a single pile of n chips. Two players take turns by removing from the pile at least one and at most m chips; the number of chips taken may vary from one move to another, but both the lower and upper limits stay the same. The winner is the last player who takes the last chip. Which algorithm design strategy is used in this game? Decrease-by-a-constant algorithm Divide-and-Conquer Variable-size-decrease algorithm Decrease-by-a-constant factor algorithm

Which sets are empty? Select one or more: a. {x: x is a even prime greater than 3} b. {x : x is a multiple of 2 and is odd} c. {x: x is an even number and x+3 is even} d. { x: x is a prime number less than 5 and is odd}

9

Q1 The periodic function sin⁡(2x) has multiple roots between x values of -5π and 5π. If xL = -15 and xU = 15, which of the following statements is true using a bracketed method? Select one: a. All roots will be returned b. The middle root will be returned c. The chosen bracket is invalid for bracketed methods d. A single root will be returned e. The algorithm will be stuck in an infinite loop     Q2 Consider x and y to represent data points (xi,yi), where i = 1, 2, 3, … n. What is the length of pafter running the following command? p = polyval(x,y) Select one: a. n b. n - 1 c. n + 1 d. Empty variable e. 1   Q3 Consider a system of linear equations in the form of AX = B, where X is the unknown vector. Which of the following can be used to solve for X? Select one: a. X = A\B b. X = B./A c. X = inv(B)*A d. X = inv(A)./B e. X = B\A

Union of two arrays W Basic Accuracy: 52.81% Submissions: 67032 Points:1 Given two arrays a[] and b[] of size n and m respectively. The task is to find union between these two arrays. Union of the two arrays can be defined as the set containing distinct elements from both the arrays. If there are repetitions, then only one occurrence of element should be printed in the union. Example 1: Input: 5 3 1 2 3 4 5 1 2 3 Output: 5 Explanation: 1, 2, 3, 4 and 5 are the elements which comes in the union set of both arrays. So count is 5.

Tennis is a racket sport that is played by two opposing players on S sets. Each set consists of at least Kgames. A set is won by a player if that player wins at least K games and at least 2 games more than theopponent. Once a set is won, the set is ended and the match continues to a new set (if any) where bothplayers start from 0 game won for that new set.For example, let K = 6, then a set can be ended with any of the following.• P1 (Player 1) wins 6 games while P2 (Player 2) wins 3 games → P1 wins the set.• P1 wins 7 games while P2 wins 9 games → P2 wins the set.On the other hand, a set cannot be ended with any of the following.• P1 wins 6 games while P2 wins 5 games → no player wins at least 2 games more than the opponent.• P1 wins 0 game while P2 wins 5 games → no player wins K = 6 games.• P1 wins 7 games while P2 wins 0 games → the set is already ended when P1 won the first 6 games.• P1 wins 8 games while P2 wins 5 games → the set must already be ended before it reaches this…

Calculating the Minimum Sum Path in a Triangle (LeetCode Problem)Given a triangle array, return the minimum path sum from top to bottom. For each step, you may move toan adjacent number of the row below. More formally, if you are on index i on the current row, you maymove to either index i or index i + 1 on the next row.   public static int minSumPathMemo(int[][] triangle)This method will calculate the minimum sum path in the triangle using the top down strategy. Note thismethod MUST BE recursive and you will need to create a recursive helper method. public static int minSumPathBottomUp(int[][] triangle)This method will calculate the minimum sum path in the triangle using the bottom up strategy. Note thismethod CANNOT be recursive and you should not create any additional helper functions.   Extra Challenge: Could you do this using only O(n) extra space where n is the total number of rows in thetriangle?  This is method signature class below: package dynamic; public class MinSumPath {…

Provide full C++ Code This assignment is a review of loops. Do not use anything more advanced than a loop, such as functions or arrays or classes. In the card game named 'blackjack' players get two cards to start with, and then they are asked whether or not they want more cards. Players can continue to take as many cards as they like. Their goal is to get as close as possible to a total of 21 without going over. Face cards have a value of 10. Write a command line game that plays a simple version of blackjack. The program should generate a random number between 1 and 10 each time the player gets a card. Each of the values (1 through 10) must be equally likely. (In other words, this won't be like real black jack where getting a 10 is more likely than getting some other value, because in real black jack all face cards count as 10.) It should keep a running total of the players cards, and ask the player whether or not it should deal another card. Sample output for the game is written…

Can you help me with this code becuase I only need help with one of the parts. I have attached my code below and task the needs to answered but you have to use my code and the variables which I have provided in the photo. question that i need help with: the Eight Puzzle consists of a 3 x 3 board of sliding tiles with a single empty space. For each configuration, the only possible moves are to swap the empty tile with one of its neighboring tiles. The goal state for the puzzle consists of tiles 1-3 in the top row, tiles 4-6 in the middle row, and tiles 7 and 8 in the bottom row, with the empty space in the lower-right corner.you will develop two solvers for a generalized version of the Eight Puzzle, in which the board can have any number of rows and columns.  A natural representation for this puzzle is a two-dimensional list of integer values between 0 and r · c -1 (inclusive), where r and c are the number of rows and columns in the board, respectively. In this problem, we will adhere…

Can you help me with this code I only need help with two of the parts. I have attached my code in the photo. question that i need help with: the Eight Puzzle consists of a 3 x 3 board of sliding tiles with a single empty space. For each configuration, the only possible moves are to swap the empty tile with one of its neighboring tiles. The goal state for the puzzle consists of tiles 1-3 in the top row, tiles 4-6 in the middle row, and tiles 7 and 8 in the bottom row, with the empty space in the lower-right corner.you will develop two solvers for a generalized version of the Eight Puzzle, in which the board can have any number of rows and columns.  A natural representation for this puzzle is a two-dimensional list of integer values between 0 and r · c -1 (inclusive), where r and c are the number of rows and columns in the board, respectively. In this problem, we will adhere to the convention that the 0-tile represents the empty space.tasks: In the TilePuzzle class, write a method…