Spaghetti Sort is a custom-designed sorting algorithm for meticulous chefs inspired by the process of sorting uncooked spaghetti by length as follows Recipe for Sorting Spaghetti (a) Grab all noodles in one of your hands (b) Hold your hand above a flat surface like a table (c) Bring your hand down so that you can make the spaghetti bottoms level (d) Hover your other hand above the noodles (e) While there are still uncooked noodles i. Lower your non-spaghetti hand at constant velocity until it hits a noodle (this must be the longest one.) ii. Remove that noodle using that hand 11. Place it at the beginning of your noodle list. iv. Return vour hand to the position it was in when it hit a noodle If we imagine a different version of spaghetti sort in which, after ensuring the bot- toms of the noodles were level, we lowered the noodles into a vat of acid (gloves required!) until they were completely disintegrated 1, we might feel inspired to port this algorithm to pseudocode as follows Algorithm 3: spaghetti-sort(L) Data: An unsorted linked-list L of natural numbers Result: L, but sorted in ascending order Result a new, empty linked-list counter 0 while L is not empty do for each node n with value x N, in the standard linked-list iteration order do if x = 0 then Append the value of counter to the end of Result Remove node n from the linked-list Continue the "for" loop from the node which came immediately after n else x x-1 (Subtract one from the element in the list) end end counter counter 1 end return Result