4. Consider the following algorithm: 2: 1: procedure FUN(n,r) if r = 0 or r= n...

Transcribed Image Text:

4. Consider the following algorithm: 2: 1: procedure FUN(n,r) if r = 0 or r= n then return 1 3: else return FUN(n-1,r-1)+ FUN(n-1,r) end if 5: 6: 7: end FUN (n) 1 point: Identify the precondition specification. (b) 2 points: Identify the postcondition specification. (c) 5 points: Prove the correctness of the algorithm. d) 2 points: Find the time complexity of the algorithm. 4. Consider the following algorithm: 2: 1: procedure FUN(n,r) if r = 0 or r= n then return 1 3: else return FUN(n-1,r-1)+ FUN(n-1, r) end if 5: 6: 7: end FUN (n) 1 point: Identify the precondition specification. (b) 2 points: Identify the postcondition specification. (c) 5 points: Prove the correctness of the algorithm. d) 2 points: Find the time complexity of the algorithm. 4. Consider the following algorithm: 2: 1: procedure FUN(n,r) if r = 0 or r= n then return 1 3: else return FUN(n-1,r-1)+ FUN(n-1,r) end if 5: 6: 7: end FUN (n) 1 point: Identify the precondition specification. (b) 2 points: Identify the postcondition specification. (c) 5 points: Prove the correctness of the algorithm. d) 2 points: Find the time complexity of the algorithm. 4. Consider the following algorithm: 2: 1: procedure FUN(n,r) if r = 0 or r= n then return 1 3: else return FUN(n-1,r-1)+ FUN(n-1, r) end if 5: 6: 7: end FUN (n) 1 point: Identify the precondition specification. (b) 2 points: Identify the postcondition specification. (c) 5 points: Prove the correctness of the algorithm. d) 2 points: Find the time complexity of the algorithm.

Answer rating: 100% (QA)

a Identify the precondition specification The precondition specifies the conditions that must be true before the algorithm is executed In this case th... View the full answer