linked structures lists consider the linked lists in figure representing three polynomials with the nodes positioned such that corresponding terms are aligned the top two lists represent the two polynomials and while the bottom list is the polynomial resulting from adding the other two lista polyhead - - - - polytail listb polyhead polytail merged polyhead polytail figure the top two linked lists store the two polynomials and the bottom list is the resulting polynomial after adding the two original polynomials in we discussed an efficient solution for the problem of merging two sorted lists we also saw how that solution could be used for the set union operationwhich required new python list containing nonduplicate items if we use similar approachcombining duplicate terms by adding their coefficientswe can produce more efficient solution for our current problem of polynomial addition merging two sorted arrays or python listsas was done in the previous is rather simple since we can refer to individual elements by index merging two sorted linked list requires several modifications firstwe must use temporary external references to point to the individual nodes of the two original polynomials these references will be moved along the two linked lists as the terms are processed and merged into the new list nextwe must utilize the appendterm(helper method to append new nodes to the resulting merged list the implementation of the add(method using the list merge technique is provided in listing