I need to implement the Q learning and SARSA algorithm in python from scratch. I'm not allowed to use the build in library gym for this algorithm, I can only use numpy and panda

Write a program using the stack for parenthesis matching. Explain what modifications would be needed to make the parenthesis matching algorithm check expressions with different kinds of parentheses such as (), ] and (}'s. Please write simple C programs to answer the question. Examine your codes with some examples. You should upload your runnable codes + report (single pdf) that explains your codes and results as a single zip file.

Write the python3 code for the given problem....    Please write C++ code also....     It's urgent!!!!!!!!!!

Python has an inbuilt process, in, for doing this.For instance: x in thislist. You should not use this method

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…

Find on the internet (or use a camera to take) three different types of images: an indoor scene, outdoor scenery, and a close-up scene of a single object. Write python code to implement an adaptive thresholding scheme to segment the images as best as you can and write a brief summary.

Design and implement a program that implements Euclid’s algorithm for finding the greatest common divisor of two positive integers. The greatest common divisor is the largest integer that divides both values without producing a remainder. In a class called DivisorCalc, define a static method called gcd that accepts two integers, num1 and num2. Create a driver to test your implementation. The recursive algorithm is defined as follows:gcd (num1, num2) is num2 if num2 <= num1 and num2evenly divides num1gcd (num1, num2) is gcd(num2, num1) if num1 < num2gcd (num1, num2) is gcd(num2, num1%num2) otherwise

In Python the only import that may be used is Numpy Implement a function called page_rank which will take as input a numpy array M, which will represent the transition matrix of a directed graph, and a positive integer n. The output will be a numpy array which gives the page ranks of each vertex in the graph represented by M. You will iterate the update process n times.

Use java and correctly indent code.

I have two questions: Is my programs code the most effective way at finding recursion or is there a much better and cleaner way? Why is the program showing 0 when I implement a number that depth is greater than 100? Shouldn't it show the number 1?   Source code: package recursiveModule; public class RecursiveMethod {    public static long calculateFactorial(int n, int depth) {        if (depth > 100 || n <= 1) {            return 1;        }                return n * calculateFactorial(n - 1, depth + 1);    }          public static void main(String[] args) {                             System.out.println("Factorial of 1 is " + RecursiveMethod.calculateFactorial(1, 0));                System.out.println("Factorial of 8 is " + RecursiveMethod.calculateFactorial(8, 0));                                      System.out.println("Factorial of 101 is " + RecursiveMethod.calculateFactorial(101, 0));                                   } }