figure dequechar_deque add_rear(chstill_equal true while char_deque size( and still_equalfirst char_deque remove_front(last char_deque remove_rear(if first !laststill_equal false return still_equal print(pal_checker("lsdkjfskf")print(pal_checker("radar") lists throughout the discussion of basic data structureswe have used python lists to implement the abstract data types presented the list is powerfulyet simplecollection mechanism that provides the programmer with wide variety of operations howevernot all programming languages include list collection in these casesthe notion of list must be implemented by the programmer list is collection of items where each item holds relative position with respect to the others more specificallywe will refer to this type of list as an unordered list we can consider the list as having first itema second itema third itemand so on we can also refer to the beginning of the list (the first itemor the end of the list (the last itemfor simplicity we will assume that lists cannot contain duplicate items for examplethe collection of integers and might represent simple unordered list of exam scores note that we have written them as comma-delimited values lists