Tiling 3*n grid c++

Question

Write a c++ program that can count how many ways to tile a 3*n grid with 3 type of dominos. A 4 piece L shaped (not tromino), a 3*1 domino, and a regular 2*1 domino. Rotation is allowed but mirroring isn't.

Answer 1

Taha we ain't gonna do that for you unless you show your attempt

Answer 2

I wanted to solve it by using recursive algorithm but it seems to be harder than this I'm still working on it