RCOMM Challenge 3: Fibonacci Numbers (Intended simple solution)

At the RComm 2010 (www.rcomm2010.org), an unusual competition was held. Titled "Who Wants to Be a Data Miner", three challenges were issued to the participants of the conference. In all challenges, participants had to design RapidMiner processes as quickly as possible. This is the original solution I had in mind for Challenge 2: "Fibonacci Numbers". It defines a macro n, recurses by applying itself using an "Embed Process" operator on n-1 and n-2, appends the results (so the length is F(n-1)+F(n-2)) and uses a "Branch" operator to stop the recursion. The live solution from the challenge is in workflow "RCOMM Challenge 3: Fibonacci Numbers (Live solution)".