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(a[1..n]) 2: if n 1 then 3: 4: 5: 6: 7: m [2/2] FINDMIN (a[1..m]) 12 FINDMIN (a[m + 1..n]) return min{11,12} else return a[1]