ould you please solve the following question in Haskell language programming.

Extend the abstract syntax tree data type Expr to add new operations Neg (negation), Min (minimum), Max (maximum), and Exp (exponentiation).

data Expr = ...

| Neg Expr

| Min Expr Expr

| Max Expr Expr

| Exp Expr Expr

...

deriving Show

Then extend the eval function (in the EvalExpr module) to add these new operations with the following informal semantics:

Neg e negates the value of e Neg (Val 1) is (Val (-1))

Min l r returns the smaller value of l and r

Max l r returns the larger value of l and r

Exp l r raises l to the poewr r