1.Please use recursive function principle and use Visual Studio or Xcode to create a function called: f (int n), which will be calculated based on following formula: f (n) = [1+f (n-1)] *2 f (0) = 0 2. Please design another function called fibonacci function: fibonacci (int n), which will be calculated based on following formula: fibonacci ( int n) = fibonacci (n-1) + fibonacci (n-2) fibonacci (0) = 0 fibonacci (1)=1 3. Please copy and paste your source code here. You don't need to compile and execute your source code. The format will be like: #include #include using namespace std; int f ( int n) { } int fibonacci ( int n) { }

Can you please use python code and explain it please

Python 3

Part (a) Write a python function that computes the binomial coefficient ("). The function should return the correct answer for any positive integer n and k where k=m pass Part (c) Suppose that the number of people in the trial is 100. Then: • Plot a curve that shows how the probability of type 1 error changes with the choice of m, for m = 1,...n assuming that the null hypothesis holds (in red), • On the same picture, plot the probability of type 2 error vs the value of m in the case in which the new drug is effective with proability 0.68 (in blue). You can plot the two curves using matplotlib.pyplot. You can select the color by passing color='r' or color='b' to the plt.plot() function. [4]: n - 100 # your code here def plot_curve (): pass [5]: plot_curve() Part (d) Based on the picture above, what value of m do you think would be suitable to keep both type 1 and type 2 error small at the same time? (You may assume that the company claims the new drug has 68% accuracy) [6]: # your…

Write a python program with the following functions:1. the function factorial_loop(num) that takes an integer num and returns the value of the factorial of num written as num!, where num! = num * (num-1) * (num-2) * … * 2 * 1. This function must use a loop (iteration) to compute the value of num!.2. the function factorial_recursive(num) that takes an integer num and returns the value of the factorial of num (i.e., num!) as defined above. This function must use a recursive algorithm to compute the value of num!.

please code in python Write a recursive function to add a positive integer b to another number a, add(a, b), where only the unit 1 can be added, For example add(5, 9) will return 14. The pseudocode is: # Base case: if b is 1, you can just return a + 1 # General case: otherwise, return the sum of 1 and what is returned by adding a and b - 1.

A Circle and Two Squares Imagine a circle and two squares: a smaller and a bigger one. For the smaller one, the circle is a circumcircle and for the bigger one, an incircle. Create a function, that takes an integer (radius of the circle) and returns the difference of the areas of the two squares. Examples square_areas_difference (5) → 50