Please explain answer

repeat n times tfor (i- 2) is (n-1); i+) Print "Hello World"; Print "Hello World"; ) When n 5, how many times will "Hello World" be printed? Give the time complexity of this pseudocode as an explicit function of n T(n)