Please, I want a correct and detailed solution for all paragraphs.

5. (a) Compute the total computing time of the following code sections using O notation.

void printAllPossibleOrderedPairs(int arr[], int size)

{

for (int i = 0; i < size; i++)

{

for (int j = 0; j < size; j++)

{

printf("%d = %d ", arr[i], arr[j]);

}

}

}

(b) Describe the order of growth for the function 5 log n + n + 3 using O notation.