**PYTHON**

Imagine a collection of nuts and bolts that are all together in one pile on a table.

Describe, in pseudocode, how you would find all matching pairs of nuts and bolts. Determine how many comparisons of pairs of nuts and bolts you might have to make in the best- and worst- case scenario. You can assume that there are complete pairs, no single nuts or bolts, and that for each bolt, there is exactly one nut that fits.

Describe a solution to the nuts and bolts problem (in pseudocode) using a Brute Force Approach, also describing how many comparisons you need to make in the best and worse case scenarios. Then, describe how you can reduce the number of comparisons by using a different approach (not pseudocode)

Thank you so much for all help in advance!