use Backtracking so that the python program print the partitioned subsets.

In Python, Compute the: sum of squares total (SST), sum of squares regression (SSR), sum of squares error(SSE), and the r, R^2 values. You can use the sum() and mean() built-in functions. Here are the x and y values to use. x = [-5,-1,3,7,5,10] y = [-10,-3,5,8,7,10]

I have a block of Python. How do I modify it to solve this classical mechanics problem (questions are in the picture)? import matplotlib.pyplot as pltimport numpy as npimport os # This solves for x such that 1+tanh(x)=alpha *x# The program first prompts for alpha print("This find zeros of function 1+tanh(x)-alpha*x")alpha=float(input("Enter alpha: ")) # This defines a function F(x) and its derivative Fprime(x)def GetFFprime(x):  F=1.0+np.tanh(x)-alpha*x  Fprime=1.0/(np.cosh(x)*np.cosh(x)) -alpha  return F,Fprime xguess=float(input("Guess a value of x: "))yarray=[]      # Make arrays with no elementsxarray=[]xarray.append(xguess)  # Add element with guess for first valueyarray.append(0.0)biggestx=xarray[0] offby=1.0E20 # used to check convergencenarray=0while offby>1.0E-7 and narray<10:  yarray[narray],yprime=GetFFprime(xarray[narray])  print("x=",xarray[narray]," y=",yarray[narray])  offby=np.fabs(yarray[narray])  xarray.append(0.0)  yarray.append(0.0)…

I need python solution please! Thank you

In python, The function slice_end takes a string parameter, word, and a positive integer n; the function returns a slice of length n from the end of word.  However, if word has length less than n, then the None object is returned instead. Hint: Notice that returning the empty string when n is zero might be a special case.  You can use an if-elif-else decision structure and the slicing operator [ : ] to solve this problem.   For example: Test Result word = "pineapple" n = 5 print(slice_end(word, n)) apple word = "too short" n = 20 print(slice_end(word, n)) None word = "llama" n = 0 print(slice_end(word, n))   word = "Saturn" n = 6 print(slice_end(word, n)) Saturn

I need the code from start to end with no errors and the explanation for the code ObjectivesJava refresher (including file I/O)Use recursionDescriptionFor this project, you get to write a maze solver. A maze is a two dimensional array of chars. Walls are represented as '#'s and ' ' are empty squares. The maze entrance is always in the first row, second column (and will always be an empty square). There will be zero or more exits along the outside perimeter. To be considered an exit, it must be reachable from the entrance. The entrance is not an exit.Here are some example mazes:mazeA7 9# # ###### # #   ## # # #### #     ## ##### ##       ########## RequirementsWrite a MazeSolver class in Java. This program needs to prompt the user for a maze filename and then explore the maze. Display how many exits were found and the positions (not indices) of the valid exits. Your program can display the valid exits found in any order. See the examples below for exact output requirements. Also, record…

make a C program that implements the "guess my number" game.  The computer chooses a random number using the following random generator function srand(time(NULL)); int r = rand() % 100 + 1;   that  creates a random number between 1 and 100 and puts it in the variable  r. (Note that you have to include <time.h>)  Then it asks the user to make a guess. Each time the user makes a guess, the program tells the user if the entered number is larger or smaller than its number. The user then keeps guessing till he/she finds the number. If the user doesn't find the number after 10 guesses, a proper game over message will be shown and the actual guess is revealed. If the user makes a correct guess in its allowed 10 guesses, then a proper message will be shown and the number of guesses the user made to get the correct answer is also printed. After each correct guess or game over, the user decides to play again or quit and based on the user choice, the computer will make another guess and…

Start with a pile of n stones and successively split a pile into two smaller piles until each pile has only one Each time a split happens, multiply the number of stones in each of the two smaller piles. (For example, if a pile has 15 stones and you split it into a pile of 7 and another pile of 8 stones, multiply 7 and 8.)  The goal of this problem is to show that no matter how the  pile of n  stones are split, the sum of the products computed at each split is equal to n(n - 1)/2. Using strong mathematical induction, prove that no matter how the pile of n stones are split, the sum of the products computed at each split is equal to n(n - 1)/2.

The following code is implementing a Treasure map use the A* algorithm to find the shortest path between two points in a map.  It appears that the initial compare looks at the f_cost and decides that we are at the point in the map and exits the routine and prints only the starting point.  I'm not sure how to fix it, any help would get appreciated.  Example of the output from the following Python program: start place = (0, 0) Treasure location: (29, 86)  Path to treasure:(0, 0) Python Code: import heapqimport random class Tile:    def __init__(self, x, y):        self.x = x        self.y = y        self.is_obstacle = False        self.g_cost = 0        self.h_cost = 0        self.f_cost = 0        self.parent = None     # Define comparison methods for Tile objects based on their f_cost    def __lt__(self, other):        return self.f_cost < other.f_cost     def __eq__(self, other):        return self.f_cost == other.f_cost class Map:    def __init__(self, width, height):…

Write a python code using IntegerRoot class that calculates integer nth root of a number m ifits nth root is an integer. For example: (m,n) where m = 1881676372240757194277820616164488626666147700309108518161,n = 3, then the integer nth root of m (i.e. the integer cubic root of m ) is: rgives an out put r = 12345678900987654321.