On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions