5. (8 points) In this question, we are going to write a Scheme program that calculates word counts. The input is a list of words and the output should be counts for words that appear in the input list. For example, if the input is '(time is long but life is short) Then one output can be ((short 1) (is 2) (life 1) (but 1) (long 1) (tine 1)) Note that you are not asked to sort the words in the output. Therefore the output is correct as long as the counts are correct. Do the following steps to implement the word-count program. In our discussion, we call a word with a count a uord-count pair, for example, (short 1) and (is 2) are word-count pairs. We call a list of word- count pairs a word-count list. (a) (2 points) Write a function initialwcList that takes a list of words and creates a word-count list. The resulting word-count list should have the word count 1 for every word. Use the map function we discussed in class to implement initialWCList. For instance