What is the worst-case time complexity of the tail-recursive tailSum method shown below?

public int tailSum(int[] arr, int index, int acc) {
    if(index == arr.length) return acc;
    return tailSum(arr, index + 1, acc + arr[index]);
}