This problem is motivated by the famous "Four fours puzzle." An arithmetic crpression tree is a binary tree that is either a single m ber or has arithmetic operations ( t o r) at its internal nodes and ambers at its leaves. The value of the tree is computed recursively by computing the value of the left subtree, the value of the right subtree, and then using the arithmetic operation at the root of that tree to combine the values of the left and right subtrees. For example, the value of the tree C. 3. 5) is 8, the value of the tree (-. 3, 5) is -2 and the value of the tree [..[., 4, 2], [-. 9. 2]] is 12. We'll use the symbol to represent division, but on your Prolog platform the operation may be // instead check if // integer division or normal division on your platform). So, the value of U. 7. 2] may be 3 or 3.5 depending on your system. Youll want to use whatever corresponds to regular division (not integer division). Now, imagine that you are given a list of arithmetic operators which is some subset of [., ,, /1, a list of integers L, an integer "target" X, and an arithmetic expression tree. The question that we ask is Does the arithmetic tree tase only the operations in the given list, cach occurrence of a number in L appears crectly once in any order), and the tree evaluates to the target value X? Here are some examples 7- solve(+,-), (1, 2, 3). 7. [+, 1, [., 3, 2]]). true 7- solve(C+,-), (1, 2, 3), 7. L., 1, L., 3, 2]]). false