3. Write the function to evaluate/compute the following, i.e. the value of Pl given by the algorithm, known as Leibniz: Write code on space provide below the problem. You do not need to Run the code... (Approximate π) can be computed using the following formula: *-**(1-+-+-+-) 3 5 7 9 11 4 X Write a program that displays the result of 4 X 1- 3 1 1 5 and 4 X 1 --+ 3 1 - + 7 9 1 1 11 -13-13). 15 + ... + 1 5 - 1 - + 7 1 9 11

please code in python 1).  Multiplication using Addition Write a function: mul(a,b) that will compute and return the product of two positive integers a and b using only a for loop and the addition operator ( + ).    Then, write a new function mul2(a,b) that does the same thing, but uses a while loop rather than a for loop.     2).  Exponentiation using Multiplication Write a function expo(x,y) that computes and returns the exponent xy using only a loop and the multiplication operator.   Then, adjust it so that rather than using the multiplication operator, it uses one of the multiplication functions you wrote in part 1.   Hints: xy is equal to (x * x * x * x ... x), y times. When you’re computing a sum using a loop, you start at 0, since anything + 0 is itself. When you’re computing a product using a loop, you start at ?, since anything * ? is itself (fill in the ?). If you wrote your mul function from part 1 correctly, then the following two lines should have the same effect, so you…

An integer is said to be prime if it’s greater than 1 and divisible only by 1 and itself. For example, 2, 3, 5 and 7 are prime, but 4, 6, 8 and 9 are not. a)  Write a function that determines whether a number is prime. b)  Use this function in a script that determines and prints all the prime numbers between 1 and 10,000. How many of these 10,000 numbers do you really have to test before being sure that you have found all the primes? Display the results in a <textarea>. c)  Initially, you might think that n/2 is the upper limit for which you must test to see whether a number is prime, but you need go only as high as the square root of n. Why? Rewrite the program using the Math.sqrt method to calculate the square root, and run it both ways. Estimate the performance improvement. Please write the code in JavaScript HTML5.

An integer is said to be prime if it’s greater than 1 and divisible only by 1 and itself. For example, 2, 3, 5 and 7 are prime, but 4, 6, 8 and 9 are not. a)  Write a function that determines whether a number is prime. b)  Use this function in a script that determines and prints all the prime numbers between 1 and 10,000. How many of these 10,000 numbers do you really have to test before being sure that you have found all the primes? Display the results in a <textarea>. c)  Initially, you might think that n/2 is the upper limit for which you must test to see whether a number is prime, but you need go only as high as the square root of n. Why? Rewrite the program using the Math.sqrt method to calculate the square root, and run it both ways. Estimate the performance improvement. Please write the code in Javasript HTML5 format