Given the following query q and data graph G. AU 1) Please draw a Neighborhood Equivalence Class tree (NEC tree) of query q. (5 marks) The Neighborhood Equivalence Class(NEC) of a query vertex u is a set of query vertices, which are equivalent to u. The equivalence is defined as follows: Let 2 be an equivalence relation over all query vertices in q such that, lli ( E rg))24( E V (g)) if for every embedding m that contains (ui, w and (ui, 0% VyE g)) there exists an embedding m'such that m'-m-l(ui, V). (uj, v))U(ui) Given the following query q and data graph G. AU 1) Please draw a Neighborhood Equivalence Class tree (NEC tree) of query q. (5 marks) The Neighborhood Equivalence Class(NEC) of a query vertex u is a set of query vertices, which are equivalent to u. The equivalence is defined as follows: Let 2 be an equivalence relation over all query vertices in q such that, lli ( E rg))24( E V (g)) if for every embedding m that contains (ui, w and (ui, 0% VyE g)) there exists an embedding m'such that m'-m-l(ui, V). (uj, v))U(ui)