in C$++$ plz$,$ Write a program that generates the following triangle pattern below:

The triangle is generated as follows: Starting with a row of single $1,$ generate the bits row$-$by$-$row from left to right. Each bit is the parity of the sum $($XOR$)$ of the neighboring bits already placed $($an $8-$way neighborhood$).$ Let the use input from keyboard the number of rows $N$ in the range $[1,30].$ Error check inputs. Output to the screen the generated triangle of size $N$ as described in the algorithm mentioned above in the shape of a triangle. Finally, the program should ask if the user wants to run the program again $($Check case$).$ Refer to the sample output below.

Sample Run:

Enter rows $[1-30]$: $5$

Run again $(\frac{Y}{N})$:nIn