The following problems below require the utilization of recursion to be solved. Must also have comments. 1. Write a python program that determine the greatest common divisor of two numbers. 2. Write a python program that computes the value of a number to a power 'n'.

Please help me create a sierpenski triangle using recursion. Please comment the code explaining each line of code. The program must be completed in java   if you can please also create a t squared fractal using java and recursion (you don't have to comment the code)

Need help with this python recursive basic pathfinding question. I have the layout of the code but I need help filling in the parts that say "pass" and I need the output of the code to match the sample run below. Our goal is to find a path (not the best path, but just any path) from A to Z.  You see that the green path is not the shortest but it does let us navigate from start to finish.  (The picture below) First, we need to know A and Z, our starting and ending points.  We'll pass these into our function.   I'm going to use a dictionary to represent this graph.  Each node (vertex, circle) will have a name, in this case "A" and "Z" were the names of the nodes, but in the generated maps I'm going to use "Node 1", "Node 2", "Node 3", etc.     Here is an example web_map web_map = { 'Node 1': ['Node 3', 'Node 2'],  'Node 2': ['Node 1', 'Node 4'],  'Node 3': ['Node 1'],  'Node 4': ['Node 2'] } Node 1 is connected to 2 and 3 for instance, and then also note that Node 3 is connected back to…

6) Write a recursive function to calculate the summation of numbers from 1 to n. For exampleif the user enters 5, your program would add 1+2+3+4+5 and print out the answer 15.7) Write a recursive program to calculate Fibonacci numbers. Use the definition of a Fibonaccinumber where F(n) = F(n-1) + F(n-2). use java to code