use Haskell programming language and plz answer ASAP

This project involves placing chess pieces from five different teams on a chessboard of varying sizes. It's a variation of the N-Queens problem, where the goal is to place N queens on an NxN chessboard in such a way that none of the queens can attack each other. In this version, the pieces can belong to the same team and other types of chess pieces are included. The pawn's attacking areas are also modified to include all pieces at its four corners. The problem has two objectives. The first is to minimize the total number of attacking positions. The second is to maximize the value of the team with the lowest value. The values of different pieces, which are used in traditional chess programming algorithms, are used for the second objective. To solve this problem, you can follow these steps: 1. Create a module to define a chessboard of a given size. You can create enumerated types for the Piece (Bishop, Knight, Rook, Queen, Pawn), Team (Red, Green, Blue, Purple, White), and Chessboard (a 2D list of tuples (Piece, Team)). 2. Define the following functions: - attackcount: This function calculates the total number of attacks on the given chessboard. - boardvalue: This function calculates the total value of the board. horizontalcrossover: This function changes the upper and lower parts of the board for a horizontal line. - verticalcrossover: This function changes the left and right parts of the board for a vertical line. - deletepiece: This function deletes a piece from the board. 3. Create a tree with a given chessboard as the head node. Each node can have 49 branches created using the horizontalcrossover and verticalcrossover functions, and 12 branches created using the deletepiece function. For different levels of the tree, find the best chessboard for both tasks