CSc $120$: Pokemon data analysis

Introduction

This problem involves some simple data analysis and aims to give you some more practice with combining Python data structures in interesting ways: in this case, using two$-$level dictionaries $($i$.$e$.,$ a dictionary of dictionaries$).$ The data, as it happens, is about$$Pokemon$($source:$$www$.$kaggle.com$).$ You are to write a program to read in Pokemon data from a file and organize it according to Pokemon type $($we will only consider$$Type $1$for this assignment$),$ then repeatedly read in queries from the user and print out solutions to those queries.

Restrictions

$1.$ For the long problems, your code should follow the$$style guidelines$$for the class.

$2.$ You may not use concepts and$/$or short$-$hand syntax not yet covered in class. The restrictions include the following:

$*$ sets

$*$ dictionary comprehensions or list comprehensions, e$.$g$.,[$n $*2$ for i in range$(10)]$

$*$ with open $($explicitly open and close the file instead$)$

$*$ the ternary operator $($use an if instead$)$

$*$ recursion

$*$ exceptions $($try$/$except$)$

$*$ type annotations

$*$ lambda expressions

$*$ importing libraries $($unless a library is explicitly mentioned in the specification$)$If you don't know what any of these are, don't worry, because you can't use them accidentally.