Runtime analysis question in C programming

Please answer it with detailed explanations

Consider the C program fragments given below. Assume that m, n and k are ints, and that the functions F 1, F 2, F 3 and F 4 have the following characteristics: The worst running time for F1(n, m, k) is O(1), and it returns a value between 1 and (n+m+k). The worst running time for F 2(n, m, k) is O(nm k) The worst running time for F3(n, m, k) is O(mk) The worst running time for F 4(n, m, k) is O(n+k) Determine a tight Big Oh expression for the worst case running time of each of the following program fragments: A. 0. F 1(n, 10, 1) B. 1. for (int i-0: i n, i++) 2. F 2(n, m, k); for (int i#0; i