solve the no 4 and 5 question only! (1,2,3,6 are solved, follow these pattern while solving 4 and 5) 4. Lucky Binary Strings: You have to generate a binary string of length n. But there can be no two adjacent 0s.

5. Permutation Generation: You are given six letters {A, B, C, D, E, F}. You have to generate a random permutation of this.

Assignment 2 2. 4 Queen Problem: You are given a 44 boskd. You have to plawe 4 queens cun the boerd so Constraint Satisfaction Problem that no two quens cen attark cach other. Rerocmher that, the quoces can move in sey direction for any amount of stejs. December 8,2022 You will be given a few computational problems. You will have to model them as constraint satisfaction problems. Four problems are solved for you. You can learn from them. Then solve only two. You only should submit the solution of those two. Do not submit solutions for problems that were solved by me. Solutione While Cormulating a problens as a CSP, one nects to ideatify the variables, the dotwains of those variablest, and the coustraints Let's expres the sudoku bourd as a 21 array B. So, the vuriahles are. V={X1,X2,X3,X4} D={D1,D2,D3,D4} 1. Sudoku: You are given a 44 sudoku. In each cell, put a value from 1 to 4 so that, every D={D1,,D2,D1,D4} where, Di={1,2,3,4} for all 1i