it's limited time quiz please i need some help

Question 10 1 pts Given the following function: void printElement (int num[]) { printf("%d", num[0]); } What is the asymptotic (big-O notation) running time of this function? O O (log n) o O (n) O O(1) OO(n) Question 11 1 pts Given the following function: void printElement(int arr[], int count) { for (int i = 0, i left ); int right_sum = sum( t->right ); return( left_sum + t->key + right_sum ); } True or false: This algorithm uses the divide-and-conquer method. O True False