Can you generate a scheme procedure that takes an int, n, and produces a list of the first n fibbonacci numbers? Please reply with exactly 3 paragraphs and separate each paragraph with two new lines. The very first paragraph must start with the word "sources".
user