I have an interview with bloomberg and met a non-leetcode problem. \nThe Input is given as a 2D matrix with True and False values, a interger variable n representing the number of iteration.\nThe output should print the pattern in n-th iteration.  The iteration follow the following rules:\n\nEach X representing a True Value and a Blank represents False. In n-th each iteration, the true value of (n-1)-th iteration will be replaced by a copy of entire n-1 iteration itself.\n\n```\n              XXX XXX XXX\n\t\t\t  X X X X X X\n\t\t\t  XXX XXX XXX\nXXX           XXX     XXX\nX X    ->     X X     X X      ->  ...\nXXX           XXX     XXX\n              XXX XXX XXX\n\t\t\t  X X X X X X\n\t\t\t  XXX XXX XXX\n```\n\nI truely have no better idea to solve it. During the interview, I was saying that creating the matrix again and again and do sime kind of simulation. Could anyone help?

I have an interview with bloomberg and met a non-leetcode problem. \nThe Input is given as a 2D matrix with True and False values, a interger variable n represe