Imagine an algorithm called AlgorithmX that is meant to find a specific element in a collection of elements. These collections can be of any size and the search element can be any element that matches in type. Since the set of possible inputs is huge, it would not be feasible to run the algorithm on all possible inputs to prove that it works correctly. Theoretically, how could a proof by contradiction be used to prove that Algorithm X works correctly on all valid inputs