In algorithms please help me answer this question I will give you a good rating :) CoinChnage draw the decision tree for the following input: coins={2,5,3,10}, value=15

CS Fundamentals of AI Use the alpha-beta pruning for 13 marbles for the "1-2 steal marbles ". Please give me the decision tree and the pseudocode about 13 marbles. PS: "1-2 steal marbles " Initially, there are 6 marbles on the board. One of the players can choose to remove 1 or 2 marbles leaving 5 or 4, after that the other player can do the same, choosing to take again one or two marbles from the board. The process continue until there is only one marble in the board. The player who wins is the one the leaves the last marble on the board. (For example: If there are 3 marbles and it's my turn , then I will choose to remove 2 to leave one in the board to win)

Objective: Write syntactically correct while/for loops Given a list of numbers and a number n, return the sum of the first n elements in the list. Assume n is less than or equal to the length of the list. For example, given [1, 1, 1, 5] and n=3, the function should return 3. (i.e. 1+1+1) user_code.py 1 # starter code 2 def sum_to_n(numbers, n): 3 4 & in 5 # your code here (replace pass with your code) *