Let A be the ternary relation such that the triple (x, y, z) is in A if and only if dog x has color y and breed z. Assume that we have all the n triples of A stored in a Java List, and that no two triples share the same dog. We can then write a method that inputs a color c and a breed b, returns a boolean that is true if and only if there is at least one dog with that color and that breed, and runs in O(n) time (meaning "time proportional to Select one: O True O False