You are at a library with a self$-$checkout kiosk. The kiosk allows you to scan and bag your items one by one. When it's time to pay, which data structure best represents the order in which you will pay for your items?

$$ Stack $($LIFO$)-$ You pay for the most recently scanned item first

Queue $($FIFO$)-$ You pay for the items in the order you scanned them

Linked List $-$ The order doesn't matter, you can pay for any item at any time

Tree $-$ There's a hierarchical structure to how you pay for items