Problem $2$: transform$($lst$)$

Given a linked list, transform it into a Python list. The head of the linked list corresponds to the left of

the Python list. When the input linked list is empty, the output Python list should be empty as well.

Example: When the input linked list is $1->2->3,$ the output Python list should be $[1,2,3]$