**In Haskell**"Recursive Structures"-- Construct a recursive data structure to represent the tree associated with a simple arithmetic expression constructed entirely from floating-point values and the binary arithmetic operators for addition, subtraction, multiplication, and division. Your structure must be able to handle division by zero without generating an error (for which you may import Data.Maybe) and it must also support the literal x (meaning your structure should be able to contain expressions like 3 + 4).