q11) Find the time complexity for the program code and represent it in Big O notation.      int p=3, q=5, r;     for(int i=0;i

Problem 7 [Algorithms integers m and k such that n = m × 24, where m is the smallest integer. For any even integer n, it is always possible to find a pair of 1. Write an algorithm that finds a factorization of any even integer n as stated above. For instance, we have the following two factorizations: 48 = 3 × 24 instead of 48 = 12 × 22 52 = 13 x 22 instead of 52 = 26 × 2. 2. Analyze the time of your algorithm by computing the number of its multiplications. Show your work step by step. Otherwise, your solution is incorrect.

Q5. Find the time complexity of the following code int b = 0; for (j = 0; jj; i--) { b=b+j+i;