alphabet defghijklmnopqrstuvwxyz get_list = ['Now', 'is', 'the', 'TIME'] finalList = def reference(n): d = dict() for k in n: if k not in d: d[k] = 1 else: d[k] += 1 return d def convert (string): listy = [] listy[:0] = string return listy def missing_letters (n): global alphabet strl = reference2 = reference (n) for let in alphabet: 11 11 if let not in reference2: strl + let return str1 for k in get_list: else: missing = missing_letters (k)| missing2 = missing.upper() if missing == ": 11 11 finalList finalList += missing for i in range (len (finalList)): for i in range (len (finalList)): if 1 i: finalList = finalList[:1] + finalList[1+1]

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

can someone please debug. written in python 

alphabet =
"abcdefghijklmnopqrstuvwxyz"
get_list = ['Now', 'is', 'the', 'TIME']
finalList =
def reference (n):
d = dict()
for k in n:
if k not in d:
d[k] = 1
else:
d[k] += 1
return d
def convert (string):
listy = []
listy[:0] = string
return listy
def missing_letters (n):
global alphabet
strl =
reference2 = reference (n)
for let in alphabet:
if let not in reference2:
strl + let
return str1
for k in get_list:
=
missing missing_letters (k)|
missing2= missing.upper ()
if missing ==
finalList =
else:
11 11
finalList += missing
for i in range (len (finalList)):
for i in range (len (finalList)):
1 == i:
if
finalList =
finalList[:1] + finalList[1+1]
Transcribed Image Text:alphabet = "abcdefghijklmnopqrstuvwxyz" get_list = ['Now', 'is', 'the', 'TIME'] finalList = def reference (n): d = dict() for k in n: if k not in d: d[k] = 1 else: d[k] += 1 return d def convert (string): listy = [] listy[:0] = string return listy def missing_letters (n): global alphabet strl = reference2 = reference (n) for let in alphabet: if let not in reference2: strl + let return str1 for k in get_list: = missing missing_letters (k)| missing2= missing.upper () if missing == finalList = else: 11 11 finalList += missing for i in range (len (finalList)): for i in range (len (finalList)): 1 == i: if finalList = finalList[:1] + finalList[1+1]
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Linked List Representation
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education