Write a function that prints out the Fibonacci sequence.
For deterministic grading, implement this as fibonacci(n), which returns the first n terms as a space-separated string with no trailing space. Return an empty string when n is zero.
Input: A non-negative integer n.
Output: A string containing the first n Fibonacci terms, starting with 0, 1.
def fibonacci(n):