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 function FINDMIN(a[L..) 2:if n > 1 then 3: 6: return min{11-12} 7:else return al