A. Write a function eval_Quadratic_Equa(a, b, c, x) which returns the value of any quadratic

 

equation of form

ax2 + bx + c

B. Write a function calc_exp(base, exp) which computes the exponent of any number, i.e.

baseexp. The function should take two values as base, which can be fl oat or integer. Exp will

be an integer greater than 0.

C. Write a function Calc_GCD_Recurr(a, b) which calculates the GCD recursively of two numbers. The function should take two positive integers and should return one integer as

GCD.

Note: The greatest common divisor (GCD) of two positive integers is the largest integer that

divides each of them without a remainder.

Example:

gcd(12 , 2) = 2

gcd(6 , 12) = 6

gcd(9 , 12) = 3