Q$1)(30$p$)$ List Manipulation: Write a Haskell function called removeDuplicates that takes a list of integers as input and returns a new list with duplicate elements removed. For example, if the input is $1,2,2,3,4,4,5,$ the output should be $,5].$ Ensure that the order of elements in the output list remains the same as in the input list.

Q$2)(30$p$)$ Higher$-$Order Functions: Define a higher$-$order function in Haskell named applyTwice that takes a function $f$ and a value $x$ as arguments and applies the function $f$ twice to $x.$ The type signature of the function should be:

$)>(a$

For example, if the function $f$ is defined as double :: Int $>$ Int $($doubling a number$),$ then applyTwice double $3$ should return $12.$

Q$3)(40$p$)$ Monads and Input$/$Output: Implement a Haskell program that reads a line of text from the user, reverses it$,$ and then prints the reversed text. Use the getLine and putStrLn functions for input and output, respectively. Ensure that the program performs these actions within the Io monad. The main function should have the following signature:

main :: IO $()$

An example interaction with the program might look like this:

Enter a line of text: CENG $241!$

Reversed Text: $!142$ GNEC