Tentaizu is a traditional Japanese game that consists of a 7x7 board with 49 slots, 10 of which are "stars". Identifying the location of these stars is the goal/objective of the game. Some slots have hints in the form of numbers that can be used to identify the right position. These hints function similarly to the minesweeper number hints in the sense that they show how many stars are nearby the slot. The values range from 0 (no stars) to 8 (fully surrounded by stars). These numbers are the only hints in a Tentaizu puzzle. The puzzle merely describes one possible combination of star positions, like other puzzle games (sudoku, etc.) Now the task is to use python to implement a solver function for a given Tentaizu puzzle. The puzzle should be recursively resolved by this function. Define the function "solve "with a 7x7 list as the input parameter, which represents the Tentaizu puzzle. A list of tuples with the right coordinates for the 10 stars should be the return value. If there isn't a valid solution, it ought to return an empty list instead: [] = solve(puzzle)