dictionaries aetc write program that asks the user to enter two strings then determine if the second string could be an encoded version of the first one with substitution cipher for instancecxyz is not an encoded version of book because got mapped to two separate letters alsocxxk is not an encoded version of bookbecause got mapped to itself on the other handcxxz would be an encoding of book this problem can be done with or without dictionary below are the notes used in musicc cd de fg ga ab the notes for the major chord are ceg mathematical way to get this is that is steps past and is steps past this works for any base for examplethe notes for major are df# we can represent the major chord steps as list with two elements[ , the corresponding lists for some other chord types are shown belowminor augmented fifth minor fifth major sixth minor sixth [ , [ , [ , [ , , [ , , dominant seventh minor seventh major seventh diminished seventh [ , , [ , , [ , , [ , , write program that asks the user for the key and the chord type and prints out the notes of the chord use dictionary whose keys are the (musicalkeys and whose values are the lists of steps suppose you are given the following list of stringsl 'aabaabac ''cabaabca ''aaabbcba ''aabacbab ''acababba 'patterns like this show up in many placesincluding dna sequencing the user has string of their own with only some letters filled in and the rest as asterisks an example is ** ***the user would like to know which of the strings in the list fit with their pattern in the example just giventhe matching strings are the first and fourth one way to solve this problem is to create dictionary whose keys are the indices in the user' string of the non-asterisk characters and whose values are those characters write program implementing this approach (or some other approachto find the strings that match user-entered string dictionaries provide convenient way to store structured data here is an example dictionaryd=['name ''todd ''phone '' - ''email ''todd@mail net '}'name ''helga ''phone '' - ''email ''helga@mail net '}'name ''princess ''phone '' - ''email '''}'name ''lj ''phone '' - ''email ''lj@mail net '}write program that reads through any dictionary like this and prints the following(aall the users whose phone number ends in an (ball the users that don' have an email address listed