What is the time complexity of the following iterative implementation used to find the largest and smallest element in an array? #include int get_max_element(int *arr,int n) int i, max_element = arr[0]; for(i = 1; i max_element) max_element = arr[i]; return max_element; int get_min_element(int *arr, int n) int i, min_element; for(i = 1; i < n; i++) if(arr[i] < min_element) min_element = arr[i]; return min_element; int main() int n = 7, arr[7] = 1,1,1,0,-1,-1,-1; int max_element = get_max_element(arr,n); int min_element = get_min_element(arr,n); printf("%d %d",max_element,min_element); return 0;

Answer: Option B