4.What does the following algorithm perform ?

Algorithm XYZ (A)

for i = 0 to n-1 do

for j = i+1 to n-1 do

if A[i] equals to A[j] then

return false

return true

5.Write a)recursive b) non-recursive functions that compute first n Fibonacci numbers.