Find the time complexity of following recurrence relation?

T(n) = 5T(n-47) + O(1) and

T(0)=1

A) O(n)

B) O(log n)

C) O(5^n)

# Time complexity1

Or you can directly use masters theorem for substract and conquer . (you can get answer faster)

T(n) = 5T(n-47) + O(1) and

T(0)=1

A) O(n)

B) O(log n)

C) O(5^n)

Or you can directly use masters theorem for substract and conquer . (you can get answer faster)