Find Country Function Name: findCountry() Parameters: capitalList ( list) Returns: Dictionary mapping each capital to its country( dict ) Description: Given a list of countries' capital cities, write a function that returns a dictionary that maps a capital to its country's name. Note: Assume that all capital cities provided are valid. example test cases: >>> findCountry('tokyo', 'delhi', 'stockholm']) {'tokyo': 'Japan', 'delhi': 'India', 'stockholm': 'Sweden'} >>> findCountry(l'paris', 'canberra', 'copenhagen']) {'paris': 'France', 'canberra': 'Australia', 'copenhagen': 'Denmark'}

Write a function in_list that will take as its parameters an input list called mylist and a number. If the number is in the list the function should retun true, ottherwise, it should retun false. def in_list(mylist,number):

JS Write a function named number_of_pairs whose parameter is an object/dictionary with strings as keys and integers as values. Your function should returns the number of key-value pairs in the parameter.

Write a function named count_vowels that accepts a string as an argument. The function should count the number of times each vowel (the letters a, e, i, o, and u) appears in the string, and store those counts in a dictionary. When the function ends, the dictionary should have exactly 5 elements. In each element, the key will be a vowel (lowercase) and the value will be the number of times the vowel appears in the string.

This code is a part of a C dictionary. Please write the code for the below requirements.   dict_get   Next, you will implement: char* dict_get (const dict_t* dict, const char* key); This function goes through the list given by dict. If you use the above structure, this means starting at el = dict->head and checking each time whether the key at el is key; if it is not, we set el = el->next, until either key is found, or we reach el == NULL. To compare key with el->key, we need to compare one by one each character in key with those in el->key. Remember that strings in C are just pointers (memory addresses) to the first character in the string, so comparing el->key == key will not do what you want. So how do you even get the length of a string s? You would start at memory location s and advance as long as the byte at s (i.e. *s) is not the end-of-string marker (\0, the NULL character). This can get a bit messy, so luckily, you are allowed to use the string comparison…

My code from milestone 1  # Define the quiz_type dictionary quiz_type = {     1: "BabyAnimals",     2: "Brooklyn99",     3: "Disney",     4: "Hogwarts",     5: "MyersBriggs",     6: "SesameStreet",     7: "StarWars",     8: "Vegetables" } # Print the welcome message print("Welcome to the Personality Quiz!") print() print("What type of Personality Quiz do you want to run?") print() for number, quiz_name in quiz_type.items():     print(f"{number} - {quiz_name}") print() test_number = int(input("Choose test number (1-8): ")) # Check if the test_number is valid if test_number in quiz_type:     quiz_name = quiz_type[test_number]     print()     print(f"Great! Let's begin the {quiz_name} Personality Quiz...") else:     print("Invalid test number. Please choose a number between 1 and 8.") ------------------------------------------------------------------- Milestone #3 code :   # Ending statements with the period to easily split them as mentioned in the question. questions = [     "I…

This section has been set as optional by your instructor. OBJECTIVE: Write a program in Python that prints the middle value of a dictionary's values, using test_dict from the test_data.py module. NOTE: test_dict is created & imported from the module test_data.py into main.py Example 1: test dict = {'a':1,'b':9,'c':2,'d':5} prints 5 Example 2: test_dict = {'b':9,'d':5} prints 5 Hint: You may(or may not) find the following function useful: list.sort() which sorts the elements in a list. Note: the result is automatically stored in the original list, and return value from the function is None Туре list = [1, 2,3,2,1] After calling: list = [1,1,2,2,3] list.sort(), 339336.2266020 x3zgy7 LAB 13.11.1: Middlest Value (Structured Types) АCTIVITY 0/11 File is marked as read only Current file: test_data.py 1 #This module creates the test_dict to be used in main.py 2 #Reads input values from the user & places them into test_dict 3 dict_size = int(input()) #Stores the desired size of test_dict. 4…

Assume the variable definitions references a dictionary.  Write an if statement that determines whether the key 'marsupial' exists in the dictionary.  If so, delete 'marsupial' and its associated value.   If the key is not in the dictionary, display a message indicating so.

Use the function design recipe to develop a function named count_odds. The function takes a list of integers, which may be empty. The function returns the number of odd integers in the list.

Game of Hunt in C++ language   Create the 'Game of Hunt'.  The computer ‘hides’ the treasure at a random location in a 10x10 matrix. The user guesses the location by entering a row and column values. The game ends when the user locates the treasure or the treasure value is less than or equal to zero. Guesses in the wrong location will provide clues such as a compass direction or number of squares horizontally or vertically to the treasure. Using the random number generator, display one of the following in the board where the player made their guess: U#  Treasure is up ‘#’ on the vertical axis (where # represents an integer number). D# Treasure is down ‘#’ on the vertical axis (where # represents an integer number) || Treasure is in this row, not up or down from the guess location. -> Treasure is to the right. <- Treasure is to the left. -- Treasure is in the same column, not left or right. +$ Adds $50 to treasure and no $50 turn loss. -$ Subtracts…