generate algorithmic solutions to the problems, with each of the following algorithm design techniques, in the Python language.- Greedy Algorithms- Dynamic Programming- Backtracking- Branch and BoundCalculate and analyze the complexity t(n) of each algorithm.Perform average comparison (minimum 3 executions with the same data pool) of time andmemory consumption for each technique and algorithm.Description of the problem: Sudoku gameIt is a 9x9 board made up of 3x3 square regions. Some cells already have numbers(immutable), the objective is to fill the empty cells with a number such that each column,row and region contain the numbers from 1 to 9 without repetition.

generate algorithmic solutions to the problems, with each of the following algorithm design techniques, in the Python language.- Greedy Algorithms- Dynamic Programming- Backtracking- Branch and BoundCalculate and analyze the complexity t(n) of each algorithm.Perform average comparison (minimum 3 executions with the same data pool) of time andmemory consumption for each technique and algorithm.Description of the problem: Sudoku gameIt is a 9x9 board made up of 3x3 square regions. Some cells already have numbers(immutable), the objective is to fill the empty cells with a number such that each column,row and region contain the numbers from 1 to 9 without repetition.