<prompt> Ngola mosebetsi ho khutlisa nomoro ea nth Fibonacci.nan  <response>: Instruction in English: Write a function to return the nth Fibonacci number. . Response in English: Fibonacci numbers are a sequence of numbers in which each number is the sum of the two preceding ones. Heres a Python function that returns the nth Fibonacci number using recursion:pythondef fibonaccin: if n 0: return 0 elif n 1: return 1 else: return fibonaccin - 1 fibonaccin - 2 . Response in Sesotho: Linomoro tsa Fibonacci ke tatellano ea linomoro moo nomoro ka ngoe e leng kakaretso ea tse peli tse tlang pele. Mona ke tsebetso ea Python e khutlisetsang nomoro ea nth ea Fibonacci e sebelisa ho pheta-pheta: python def fibonaccin: haeba n 0: khutlisetsa 0 elif n 1: khutlisetsa 1 e ngoe: khutlisetsa fibonaccin - 1 fibonacci n - 2 