Suppose that you lost the combination to a combination lock that consisted of three digits, and each was selected from the digits \(0,1,2,3,4,5,6,7,8\), or 9 . You desperately need to open the lock without breaking it. You decide to check all possible combinations methodically, 000 , then 001 , then 002 , and so on until you find the right combination. Is this an example of a brute force algorithm or a greedy algorithm?