A relation on the set A = {1, 2, 3} is any subset of A × A. How many relations on A are both reflexive and symmetric? Count every such relation, including the smallest one, which contains only the pairs it is forced to contain. | StemPy Lab