(10 pts)
In this problem, you’re going to modified the code in this Observable notebook to compute the number ways non-attacking kings can be placed on an m\times n board. To get your precise problem statement, choose your name from the following list: