To keep on top of how much there is to do, Jo wishes to know the number of tasks of each priority. Write a problem definition for a function count priorities that will return a dictionary. The keys of the dictionary will be the priorities held within the queue; its values will be the frequency of occurrence of the priority in question. For example, if Jo's queue currently looks like this: then the dictionary returned would be: {1:3,2:1} Note: The dictionary has been printed across multiple lines here for clarity; the actual output would be {1:3,2:1}. Jo can interpret this as there are three tasks of priority 1 and one task of priority 2. Function: count priorities Inputs: Preconditions: Output: Postconditions