<prompt> Ngola algorithm ea ho hatisa linomoro tsohle tsa Fibonacci ho fihla ho 100.nan  <response>: Instruction in English: Write an algorithm for printing out all Fibonacci numbers up to 100. . Response in English: Here is one possible algorithm for printing out all Fibonacci numbers up to 100:1. Initialize two variables, a and b, to store the first two numbers 0 and 1 of the Fibonacci sequence.2. Print the value of variable a which is 0, the first number of the Fibonacci sequence.3. Initialize a loop that will continue until the value of variable a is greater than 100.4. Inside the loop, perform the following steps: a. Add the values of a and b and store the result in a new variable c. b. Check if the value of c is greater than 100. If it is, break out of the loop. c. Otherwise, print the value of c, which is the next number of the Fibonacci sequence. d. Update the values of a and b so that the next iteration of the loop can generate the next number of the sequence. Set a to the value of b and b to the value of c.5. End the loop. All Fibonacci numbers up to 100 have been printed. . Response in Sesotho: Mona ke algorithm e le ngoe e ka khonehang bakeng sa ho hatisa linomoro tsohle tsa Fibonacci ho fihlela ho 100: 1. Qala mefuta e meli, a le b, ho boloka linomoro tse peli tsa pele 0 le 1 tsa tatellano ea Fibonacci. 2. Hatisa boleng ba ho feto-fetoha a e leng 0, palo ea pele ea tatellano ea Fibonacci. 3. Qala loop e tla tsoela pele ho fihlela boleng ba feto-fetohang a bo feta 100. 4. Ka hara lupu, etsa mehato e latelang: a. Eketsa boleng ba a le b mme o boloke sephetho ho cb e ncha e feto-fetohang Sheba hore na boleng ba c bo boholo ho feta 100. Haeba ho joalo, tsoa ho lupu. c. Ho seng joalo, hatisa boleng ba c, e leng palo e latelang ea tatellano ea Fibonacci. d. Ntlafatsa boleng ba a le b e le hore phetisetso e latelang ea loop e ka hlahisa palo e latelang ea tatellano. Beha a ho boleng ba b le b ho boleng ba c. 5. Qetella loop. Linomoro tsohle tsa Fibonacci ho fihla ho 100 li hatisitsoe. 