PYTHON CODE FOR THIS PLEASE.

SODs week 15 Tark 5 Thresthald: - Write a stick pragrem to reverse the wond: 'roma' Isek1 Write pour pamputetional thinkirg pracess about the telewing prokiem on a paper laskb Censiber the queue_dass implemertation an the Univul Find tha amaller alament in the list below - Write qu.eus progam implementing buyirg tickets to a caneert le. 8. Tickermastarj list values =[10,20,30,20,30,40,4,1100] - CCreata pour onn sosenario of hora you wish to raprasant the dataj Fmollent: Tseke Dne of the taiks would be done to get an cmellent SXOH abserve Wint your computat ond thialang aracess about the prablem en the paper Cyunt sl the ocvumences al element it the list belon lakk list_vlues =[10,30,1,30,20,30,40,4,1100] Write you correstationgl thinkire process lor vhis problen ss well as implement the code: Imagne yeu have 100 doara in a raw that are al initialy flesed. You moing ta make 100 pases by es:h of theee doors. Ard on the first pass, 'ou poine to visit each dorr in sequense and torste it state. So thet means if it': alosed, it becumes open. If it's ofen, it becomes closed. Since sll the dours are initallf dosed, this will Taek3 result in al tha doars haing ogan after tha firat posse What alements will bo on the stack 'from top to tortamy if the following oncratians aro camiod su. lin Fo' the. incond aici, pou vit cucy amend don and toggla it atite. the order gunn', on an empty atack Fo' the thind pass, you visit cenary thind doar, and sa an and sa forth, unti yau anly vilit the lunt a an - Pust "Fabbit the 100 th pass - Hust "Mclse" - Hust "iertl" - Peek. - Pep lasks - Pust "Hamsrar" Write your understancing of Hash Table - Pap Implement Hash Table cass Taski yn emply slack? - enquele Rabert" - enqueles 'Mouas - enqueve 'Gertil" - deqleve - enqueve "Hamster" - doql.fise