Please write code in Octave.

The Collatz sequence is defined recursively in the following way. Let a be a positive integer and ai/2 a;+1 = 3a; +1 if a; is even, if a; is odd, for i > 0. Write a function collatz(a,n) that prints the first n terms of the Collatz sequence whose first term is a . (You may want to look at the function mod to test divisibility by 2.) Report the results you get when you run collatz(5,10), Collatz(10,10), Collatz (20,10), collatz(30,20) ? Do you observe anything interesting? (As an example, collatz(7,5) should produce the five numbers 7, 22, 11, 34, 17.)