Does this function use recursion or iteration? Say only the answer without an explanation

def Fibonacci(n):
    if n<= 0:
        print("Incorrect input")
    # First Fibonacci number is 0
    elif n == 1:
        return 0
    # Second Fibonacci number is 1
    elif n == 2:
        return 1
    else:
        return Fibonacci(n-1)+Fibonacci(n-2)
system
kya yah fnction punaravarti yaa punrariti kaa upyog karata he?keval ek spashtikaran ke bina uttar kahen

DEF FIBONACCI (n):
    yadi n <= 0:
        print ("galat input")
    # pehla fibonachi number 0 he
    elif n == 1:
        vaapasi 0
    # doosraa fibonachi number 1 he
    eliff en == 2:
        lauten 1
    anya:
        ritern fibonachi (en -1)+fibonachi (en -2)
user
prayaavartan
assistant
<|system|>
</s>
<|user|>
kya yah fnction punaravarti yaa punrariti kaa upyog karata he?keval ek spashtikaran ke bina uttar kahen

DEF FIBONACCI (n):
    yadi n <= 0:
        print ("galat input")
    # pehla fibonachi number 0 he
    elif n == 1:
        vaapasi 0
    # doosraa fibonachi number 1 he
    eliff en == 2:
        lauten 1
    anya:
        ritern fibonachi (en -1)+fibonachi (en -2)</s>
<|assistant|>
prayaavartan</s>
