Let us illustrate recursion by studying the operation of short artificial recursive programs. Each part defines a recursive procedure called rekursio and the task is to write down the output of the call rekursio(4). Assume that all numbers are printed on the same line separated by single spaces. For example, if the call outputs the numbers 1, 2,3 and 4, the correct answer is "1 23 4" (without quotation marks). Hint: Find out first what is the output of rekursio(1). Use this to figure out the output of rekursio(2), etc. procedure rekursio(n) if n==0 return print(n) rekursio(n-1) procedure rekursio(n) if n=0 return print(n) rekursio(n-1) print(n) procedure rekursio(n) if n=0 return rekursio(n-1) print(n) rekursio(n-1) procedure rekursio(n) if n=0 return print(n) rekursion (n1) rekursio(n-1)