Consider the problem of computing min-max in an unsorted array where min and max are minimum and maximum elements of an array. Algorithm A1 can compute min-max in a1 comparisons using divide and conquer. Algorithm A2 can compute min-max in a2 comparisons by scanning the array linearly. What could be the relation between a1 and a2 considering the worst-case scenarios?

- a1 < a2.
- a2 > a1.
- a1 = a2.
- Depends on the input.