$8.$ Ture or False. Indicate whether the algorithm correctly solves the problem. Problem: A stack of $1000$ name tags is unsorted but should be sorted.

Algorithm:

Start $26$ new stacks for names starting with A$,$ B$,...,$ Z$.$

Remove one tag, place in appropriate new stack, in sorted order in that stack.

Repeat step $2$ until no tags remain in original stack.

Stack the $26$ stacks into one stack in sorted order.