Problem 4. In a box below you can see a pheudocode for a divide and conquer algorithm that finds the minimum number in an unsorted array. Estimate its running time. Write the equation for the running time, and solve it. Algorithm 1 A divide and conquer algorithm for computing the minimum number in an array 1: function FINDMIN(a1..r) 2: If n > 1 then 5: 6: return minfl1, 12) 7: else return all]