Runtime and Correctness property of Split Recursive Factorial

Question

What would the big O runtime and correctness property for the split recursive factorial function be?

Factorial(l, h)
    if lo = hi then return lo
    mid ← b(l +