) Suppose both functions aFn(i) and bFn() require only one unit of time to be executed. Find the complexity T(n) of the Python code segment above, where n is the size of the input data. No explanation required. b) Suppose function aFn(i) requires i units of time to be executed and bFn()requires only one unit of time. Find the complexity T(n) of the Python code segment above, where n is the size of the input data. No explanation required. c) Given complexity function f(n)=AnA+Bn+nAB+B where A and B are positive integer constants, use the definition of Big-O to prove f(n)=O(nAB). Clearly show the steps of your proof. (* Use definition, not properties of Big-O.)

Have a question requiring an answer in assembly language

write a fortran 90 program to generate

3. Write a C++ program that implements the following three algorithms and times for various values of n. The program should display a table of the run times of each algorithm for various values of n. //Algorithm C sum = n * (n + 1) / 2 //Algorithm A sum = 0; for (i = 1 to n) sum = sum + 1 //Algorithm B sum = 0; 1 to n) for (i { for (j = 1 to i) sum = sum + 1 }

Write an assembly language program to solve the following equation. Write appropriate declaration for variable Y / RESULT, and store final value in the variable. y = (A + B^2/C) * D - B

Create the algorithm and implement in a programming language of your choice. Provide the following: Input, Output, Sample, and Code. ------------------------------Find the sum of five inputted numbers. *

Write a C program to accept the user input (a positive integer) n, which represents thesize (or length) of an int array. Allocate the memory for this array according to n, andfurther initialise this array (from the first element to the last) using the number from n to1. You will need to consider the (potential) memory management issue.

Write an assembly language program to solve the following equation. Write appropriate declaration for variable Y / RESULT, and store final value in the variable. y = (A + B^2/C) * D - B

Write a Python program that implements the Taylor series expansion of the function (1+x) for any x in the interval (-1,1], as given by: 1(1+x) = x-x²/2 + x³/3 - x^/4 + x³/5. The program prompts the user to enter the number of terms n. If n> 0, the program prompts the user to enter the value of x. If the value of xis in the interval (-1, 1], the program calculates the approximation to l(1+x) using the first n terms of the above series. The program prints the approximate value. Note that the program should validate the user input for different values. If an invalid value is entered, the program should output an appropriate error messages and loops as long as the input is not valid. Sample program run: Enter number of terms: 0 Error: Zero or negative number of terms not accepted Enter the number of terms: 9000 Enter the value of x in the interval (-1, 1]: -2 Error: Invalid value for x Enter the value of x in the interval (-1, 1]: 0.5 The approximate value of ln (1+0.5000) up to 9000 terms…