please use python language

Task 1: N-Queens Brute Force In mathematics, the notion of permutation relates to the act of arranging all the members of a set into some sequence or order, or if the set is already ordered, rearranging (reordering) its elements, a process called permuting. The number of permutations on a set of n elements is given by nl (Read as n factorial). For example, there are 21 = 2 x 1-2 permutations of (1,2), (2,1) and 31-3x2x1=6 permutations of (1,2,3), (1,3,2), (3,1,2), (3,2,1), (2,3,1), (2,1,3). A brute force algorithm for N-queens problem goes as follows: Generate all possible permutations of 1, 2, ... Ni.... N. Set a counter to 0. . For each permutation place the queens on the board. Test if this configuration is valid; If so, increment the counter. Implement the brute force algorithm for 4-queens problem For example, your program may output: Enter the size of N: 4 Number of solutions: 2 0000 Q000 0000 0000 MONASH College Page 1 MCD4710 - Week 10 - Practical 0000 0000 Q000 000D