Suppose you are given an array A

consisting of distinct elements having length n$>=2$

where n

is a power of $2.$ Give pseudocode for a linear$-$time divide$-$and$-$conquer algorithm that computes $($and returns$)$ the smallest and the $2$nd smallest elements in the array A

$.$

Give a recurrence relation for the running time of your algorithm and use the Master theorem to show that your algorithm runs in linear$-$time