Given an intially empty linked lists,draw the diagram which explain the status of linked list after each operation.

(1)insert_first(2); (2)insert_first(1); (3)insert_first(0); (4)insert_last(4); (5)insert_last(5); ?(6)insert_between(3,2); (7)insert_berween(7,6); ?(8)delete_first(); ?(9)delete_last();