write a recursive function that adds elements in ascending order
<p>I have to write the recursive function insertSort. Given a list of
type x and an element of type x insert the element into the list such
that the list is in ascending order. Duplicates are allowed. The input
list will be properly sorted.</p>

<p>expected output:</p>

<pre><code> insertSort [] 3 -&gt; [3]
    insertSort "btt" ’u’ -&gt; "bttu"
    foldl insertSort [] [] -&gt; []
    foldl insertSort [] [3,1,5,5,3,0,1,8,4] -&gt;
    [0,1,1,3,3,4,5,5,8]
</code></pre>

<p>I'm new in haskell.I know how to add element but I don't know how to add in ascending order.Please someone help me</p>