title: Find the K'th element of a list using foldr and function application ($) explanation
body: <p>I'm currently at 6th chapter of Learn you a Haskell... Just recently started working my way on 99 questions. </p>
  
  <p>The 3rd problem is to  find the K'th element of a list. I've implemented it using <code>take</code> and <code>zip</code>.</p>
  
  <p>The problem I have is understanding the alternate solution offered:</p>
  
  <pre><code>elementAt''' xs n = head $ foldr ($) xs 
                       $ replicate (n - 1) tail
  </code></pre>
  
  <p>I'm "almost there" but I don't quite get it. I know the definition of the <code>$</code> but.. Can you please explain to me the order of the execution of the above code. Also, is this often used as a solution to various problems, is this idiomatic or just... acrobatic ?</p>