Select the recurrence relation that describes the number of times the following algorithm prints Hola! in...

 

Transcribed Image Text:

Select the recurrence relation that describes the number of times the following algorithm prints "Hola!" in terms of the input n. You do not need to solve the recurrence. You may assume integer addition. T(n): = T(n) = Procedure Greeting (n): if n = 1: T(n) = { print("Hola!") else: None of these. for i=1 to n: [T(²) +T(7) + n 1 T(n) = {T(²) +T(7) if n>1 otherwise print("Hola!") 8 Greeting (n/8) Greeting (7n/8) T() if n < 8 T(7) if n>8 otherwise if n > 1 otherwise +n if n>1 otherwise Select the recurrence relation that describes the number of times the following algorithm prints "Hola!" in terms of the input n. You do not need to solve the recurrence. You may assume integer addition. T(n): = T(n) = Procedure Greeting (n): if n = 1: T(n) = { print("Hola!") else: None of these. for i=1 to n: [T(²) +T(7) + n 1 T(n) = {T(²) +T(7) if n>1 otherwise print("Hola!") 8 Greeting (n/8) Greeting (7n/8) T() if n < 8 T(7) if n>8 otherwise if n > 1 otherwise +n if n>1 otherwise

Answer rating: 100% (QA)

Sol Griven Procedure Greeting n if n 1 So reccure... View the full answer