Lower Bounds on the Worst-Case Complexity of Efficient Global Optimization