Question 3. [ 4 points ] Given an n-element array A, Algorithm X executes an O(n)-time computation for each even number in A and an O(log n)-time computation for each odd number in A. a)What is the best-case running time of Algorithm X? b) What is the worst-case running time of Algorithm X? Give a big-Oh characterization, in terms of n, of the running time of the following piece of code. Show your analysis. d) int x 0; for (int i=0; i