Question

Problem Statement
...
You are given an integer N. Find the number of strings of length N that satisfy the
following conditions:
• The string does not contain characters other than G, O, A and T.
• The string does not contain "AOT" as a substring.
• The condition above cannot be violated by swapping two adjacent characters
once.
Since the answer can be large return the answer modulo 10^9 + 7.
Note: A substring of a string T is a string obtained by removing zero or more characters
from the beginning and the end of T. .
in java language​

Answer 1

Answer:

the outlet fashions/customer/care //number/6289204717