12/20 Reading Code #2 (20 pts) Draw the resulting lists for each of the following neighborhood LinkedList problems after all the code in a particular cell has been executed. You may assume that each of these are individual (you start with the original lists for each individual cell). Following are the original lists: lista -> 8 list2 > 3 1 + + 4 +7 + +2 5 1 Code Resulting lists list1.next = list2.next; list, B M > 4 list2.next = list2.next next; ) > 12-192 >2) list1 = list2; list2.next = list1.next.next.next; list-> 22]>01 5 2 Plist, 120h 21 157 Tista 1 171-12) > 152 ist -> > > > list2.next = list1.next next next; list1 = list2; list1.next next = new ListNode(3); list1.next next next = list2; list2.next = list2.next.next; list2 = new ListNode(4, list1); list2.next = list2.next.next; ID > >> list1.next = list1.next.next; ListNode temp = list1.next next next; list, 1 -->3 > > X list, 18) 3 - lista listaBD > Mon 18) lista >7 >21->) >]] > list -> H D ) temp 11) 1999 1874) tempoh AD 1910 list, 1814] 1972 temps i 17 - 1632 temp 122] 0 152 132 list -> 2 >2 B2 temp.next = new ListNode(3, temp.next); list2 = temp; ListNode temp = list2.next.next; temp.next = temp.next.next; list1 = temp.next