Please show your detail steps

Problem 2: Using standard big-O notation, describe the running time of the following algorithm (assume arrays are 0-indexed) 1: function STRANGESUM(array X) 2 3: 4: while count length(X) count 0 5: 6: 7: 8: 9: 10: count count + 1 return 2. + StrangeSum(X10 : length(X) return r + StrangeSum(X[length(X)/2: length(X)]) if count is even: else: 11: end function