Give the pseudo code and javacode for a recursive algorithm that computes the product of two positive integers ‘m’ and ‘n’ using only addition and subtraction.

Write a recursive method to print all the permutation of a string. For example, for the string “abc” , the permutation is [abc, acb, bac, bca, cab, cba]

Write a program in Python that converts Euclid’s algorithm to find the greatest common divisor (GCD) of two positive integers to a recursive function named gcd.

Write a recursive implementation of Euclid's Algorith for finding the greatest common divisor(GCD) of two intergers. Descriptions of this algorithm are available in algebra books and on theweb. (Note: A nonrecursive version of the GCD problem was given in the programming exercisesfor Chapter 7.) Write a test program that calls your GCD procedure five times, using thefollowing pairs of integers: (5,20),(24,18),(11,7),(432,226),(26,13). After each procedure call,display the GCD.