Python 3

FOLLOW INSTRUCTIONS PLEASE

#COMMENTED EXPLANATION

Problem

A Fibonacci string is a specific sequence of binary digits (0s and 1s), computed by repeatedly concatenating previous strings. We define the n-th Fibonacci string to be:

F(n) = F(n - 1) + F(n -2)

where the + operator means a string concatenation. The first two Fibonacci strings are:

F(0) = "0"

F(1) = "01"

Examples

FibonacciString(2) should return "010" (i.e. "01" + "0")

FibonacciString(3) should return "01001" (i.e. "010" + "010)

1 def FibonacciString(n) Problem A Fibonacci string is a specific sequence of binary digits (Os and 1s), computed by repeatedly concatenating previous strings. We define the n-th Fibonacci string to be: F(n) = F(n- 1) + F(n-2) where the + operator means a string concatenation. The first two Fibonacci strings are: F (1 "01 Examples Pibonaccistring (2) should return "010" (i.e. "O1" + -0") Fibonaccistring (3) should return "01001" (i.e "010+ "010) Python 3.6.1 (default, Dec 2015, 13:05:11) [GCC 4.8.21 on linux