write a computer program to implement the Prim’s algorithm for finding the Minimum Spanning Tree (MST) for given undirected graph G (V, E) with weights. Students can use: Python, Verify the correctness of your program by solving the problem of finding the MST for the following graph as explained in the class.

Using the C Programming language, write a program that sums an array of 50 elements. Next,optimize the code using loop unrolling. Loop unrolling is a program transformation that reduces thenumber of iterations for a loop by increasing the number of elements computed on each iteration.Generate a graph of performance improvement.

Code in PYTHON

Please do it using recursive approch. Recently | asked the same question, but i get in iterative approch. So please take mind on that. Write a java program to find the LCM of two user entered integer numbers.

Write a static recursive method in Java called mRecursion that displays all of the permutations of the charactersin a string passed to the method as its argument. For example, the character sequence abc has thefollowing permutations: acb, bac, bca, cab, cba. Then Write a static method called getInput that get aninput string from the user and passed it to the mRecursion method written above in a method call.Please does so using what I already had   //Get input from in to call recursive method        //to display those char permutations        public static String getInput ( ) {            Scanner in = new Scanner(System.in);            String combination = in.nextLine();            System.out.println("Enter string:);             return stringComb; //Method to show permutations of a desired string// This only return 3 string combination for some reason        static void myRecursion(String aString) {            //isEmpty check            if ( aString.length() == 0){…

Write a program in C that, given two points on a two-dimensional graph, outputs a message (string) if the line that connects them is horizontal or vertical, or if the slope is positive or negative.What would you modify or adjust in your code if we move from a 2D cartesian system to a 3D dimensional cartesian system?You need to take into consideration if the system is 3D and therefore you need to ask the user to insert X, Y , and Z.

The factorial of a positive integer n —which we denote as n!—is the product of n and the factorial of n 1. The factorial of 0 is 1. Write two different recursive methods in Java that each return the factorial of n. Analyze your algorithm in Big-Oh notation and provide the appropriate analysis, ensuring that your program has a test class.

program bust be solved by python anaconda .My variant number is ( 21 )

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…

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