Algorithm A executes an O (log n )-time computation for each entry of an n -element array

Algorithm A executes an O (log n )-time computation for each entry of an n -element array.

1. Algorithm A executes an O(log n)-time computation for each entry of an n-element array. What is the worst-case running time of Algorithm A?

2. Given an n-element array X, Algorithm B chooses log n elements in X at random and executes an O(n)-time calculation for each. What is the worst-case running time of Algorithm B?

3. Given an n-element array X of integers, Algorithm C executes an O(n)- time computation for each even number in X, and an O(logn)-time computation for each odd number in X. What are the best-case and worst-case running times of Algorithm C?