6-Python-Binary ToDecimal Highest grade: Problem Statement The base 2, or binary numbering system, is used for data storage in all computing systems and electronic devices. Given a string of ones and zeroes, convert the binary string to an unsigned integer. If you are given a string that contains a digit NOT appropriate for a binary number (e.g., '2'), print out an error message for the user "ERROR: Input is not a binary number." (HINT: use the Python Membership check operator in ), In CSCI101 we learned one approach to convert binary to decimal: 1. Starting with the rightmost bit (i.e., least significant bit), multiply the digit by the value of the placeholder (base 2, exponent positional index) 2. Continue doing this and adding the results as you move right->left until you reach the leftmost bit (i.e., the most significant bit). NOTE: you are not allowed to use any built-in method or library to do the conversion. Your next 101 Python assignment will be to write a more complex number system converter, so use this Studio exercise as a warmup or a verification that the algorithm of your binary converter works! Sample Input 1 Submit 7-Python-QuickBrown Fox Highest grade: Image by Neil McIntosh Problem Statement A pangram is a phrase that includes at least one occurrence of each of the 26 letters, a......Z. You're probably familiar with this one: "The quick brown fox jumps over the lazy dog." Your job is to recognize pangrams. For phrases that don't contain every letter, report what letters are missing. We'll say that a particular letter occurs in the phrase if it occurs as either upper case or lower case. Each line of input is at least one sentence, possibly containing uppercase and lowercase letters, spaces, digits, and special characters. For each line of input, output 'pangram' if it qualifies as a pangram. Otherwise, output the word 'missing' followed by a space and then all of the letters that didn't occur in the phrase. The list of missing letters should be lowercase and should be sorted alphabetically. A potential solution uses a string of all letters and a list of booleans. Also, note that you can multiply a list to duplicate it that number of times, i.e. [1] * 10 = (1, 1, 1, 1, 1, 1, 1, 1, 1, 1). Submit