Assume the following lists each implement the List ADT as efficiently as possible for their given data structure specified below: L1 is an array list that has been filled with P items. L2 is a singly-linked chain of nodes with only a head reference and has been filled with Q items, L3 is a singly-linked chain of nodes with both head and tail references and has been filled with R items, o L4 is a circular, doubly-linked chain of nodes with only a head reference and has been filled with S items. What is the worst-case time complexity for each code fragment below? Express the complexity using "Big-O" notation and making sure to use the appropriate variables that correspond with the problem size. Assume printing output, doing .equals(), and constructing a new item take constant time