A one-dimensional minefield can be represented as a string of characters, in which the character X is interpreted as a mine, and a whitespace character is interpreted as mine-free. Write a Python function "encode" that takes a minefield and transforms it into a string in which each position contains a digit indicating the number of adjacent positions that are not mine-free (this can be 0, 1, and 2).

Next, write a Python function "decode" that translates such a string of adjacency information back to minefields and prints the corresponding minefield(s). Test cases: " X X X X " encodes to "102020201" " XXX XXX " encodes to "112121211" "XX XXX XX" encodes to "112121211" " XXXXXXX " encodes to "112222211" "XXXXXXXXX" encodes to "122222221" "XX XX" encodes to "111000111" "X" encodes to "0" " " encodes to "0" Observe that several minefields share the same adjacency information!

Hint 1 (decode) As you might have noticed, the same encoded string might correspond to multiple minefields! Because of this, implementing decode directly is quite hard. Think about possible ways to include your encode function in the required decode function.

Hint 2 (decode) Try to enumerate all possible minefield configurations. Then, check for each minefield whether the encoded string corresponds to the given string by using encode. If this is the case, the minefield is one of the possible answers!

More test cases: encode(" X X X X ") - '102020201'encode(" XXX XXX ") - '112121211', encode("XX XXX XX") - '112121211', encode(" XXXXXXX ") - '112222211', encode("XXXXXXXXX") - '122222221', encode("X") - '0'. Your solution must pass ALL the test cases please. Solution should be in Python.