There is a 2*n square, which is filled with 3*2, 2*1, 1*2 three squares. Enter size : n, the number of output methods.

Write it in C code - Implement with recursive

Sample:

ENTER:1 PRINT: There is a way ENTER:2 PRINT: There are 3 ways ENTER:3 PRINT: There are 5 ways ENTER:4 PRINT: There are 11 ways ENTER:5 PRINT: There are 21 ways ENTER:6 PRINT: There are 43 ways ENTER:7 PRINT: There are 85 ways ENTER:8 PRINT: There are 171 ways ENTER:9 PRINT: There are 341 ways ENTER:10 PRINT: There are 683 ways