## Problem $2$

Write code which, given a list $`$L$`,$ produces a dictionary $`$D$`$ where:

$-$ The $*$keys$*$ of $`$D$`$ are the unique elements of $`$L$`($i$.$e$.$ each element of $`$L$`$ appears only once$).$

$-$ The value $`$D$[$i$]`$ is the number of times that $`$i$`$ appears in list $`$L$`.$

Demonstrate that your code works for lists of strings, lists of integers, and lists containing both strings and integers. $($it$\text{'}$s fine to copy and paste your code for this, although if you happen to know how to define functions then you might find that more efficient$).$

For example:

$```$python

L $=["$a$","$a$","$b$","$c$"]$

# your code here

# $...$

D

# output

$\{"$a$"$ : $2,"$b$"$ : $1,"$c$"$ : $1\}$