Answer the following questions regarding the function

/ ***

This function finds the smallest of an array

A: Search array

n: array size

RETURN

minor: minor value of the array

*** /

int minor (int A [], int n)

{int i, minor;

minor = A [0];

for (i = 1; i

{if (A [i]

minor = A [i];

}

return minor;

}

1. Write the function that indicates the number of instructions that would be executed in the worst case scenario.

2. Using Big O notation, write the order of complexity of the function