Consider the following graphs to be representations of ARSs. For each of the graphs, determine if its ARS is Terminating, Confluent, and has Unique Normal Forms. Then rewrite the ARS in the standard notation (i.e. A={...} R={...}) Consider the following ARSs. Rewrite each ARS as a graph then determine the properties of the ARS as in question 1. $A = {a, b, c, d, e, f}$ $R = {(a,b),(a,c),(c,e),(e,a),(f,d)}$ $A = {a, b, c, d}$ $R = {(a,a),(a,b),(a,c),(b,a),(b,b)(b,d),(d,d)}$