Algorithm for Conversion from an Arabic number to a modern Roman number. in: decimal number n (0 ≤ n) out: sequence R =
s0, s1,...,s12 representing the structure of the Roman number (Ri = number of primitives Vi in n for i ∈ [0, 12])

Explain

Write a recursive function that accepts a number and returns its factorial. b. Write a recursive function that accepts an array, its size and the index of the initial element as arguments. The function fills the array with the elements of the following sequence: n1 = 3, nk+1 = nk+35 c. Write an iterative and a recursive versions of the binary search. In C++ coding

CODING QUESTION.  Euler's totient function, also known as phi-function ϕ(n),counts the number of integers between 1 and n inclusive,which are coprime to n.(Two numbers are coprime if their greatest common divisor (GCD) equals 1)."""def euler_totient(n):    """Euler's totient function or Phi function.    Time Complexity: O(sqrt(n))."""    result = n.

Python language

Python question Application: Big-O Notation (Q8-11)  For each of the time complexities in this segment give the tightest bound in terms of a simple polylogarithmic function using big-O notation. Note: use the ‘^’ symbol to indicate exponents, i.e., write O(n^2) for O(n2).   Question 8 (Big-O Notation 1) T(n) =  n2+ log n + n   Question 9 (Big-O Notation 2) T(n) = n/3 + 4 log n + 2n log(n)   Question 10 (Big-O Notation 3) T(n) = 7n5 + 2n   Question 11 (Big-O Notation 4) T(n) = (n%5) + 12,000

Write direct sum function for int64_t sum(int64_t N, uint64_t A[])

What does the following recursive function do? int f(int n){ if (n==1) return 1; else returm n*f(n-1); } O sum of numbers from 1 to n Factorial of numbern Square of numbers from 1 to n Print the numbers from 1 to n

q16

solve by hand do not use code