Write the following English language query in regular property graph logic:Return the trek nodes that have 2 or 3 sections.Such as:（答案像以下这种格式写出来）result(y) ← :flight(x, y), x.name = “Papeete”result(y) ← :flight(x, s1), :flight(s1, y), x.name = “Papeete”result(y) ← :flight(x, s1), :flight(s1, s2), :flight(s2, y), x.name = “Papeete”

Such as:（答案像以下这种格式写出来）result(y) ← :flight(x, y), x.name = “Papeete”result(y) ← :flight(x, s1), :flight(s1, y), x.name = “Papeete”result(y) ← :flight(x, s1), :flight(s1, s2), :flight(s2, y), x.name = “Papeete”

Write down the following English language queries in XQuery, and show the result of evaluating the XQuery query on the given XML document. (a) For every distinct location l for which no trek with rating less than 85 exists, return an element node with label location that has the following content: i) a child element labelled location name with the name of the location as text content, and ii) for each trek in that location, an element child labelled trek with the name of the trek as text content.

Write down the following English language queries in XQuery, and show the result of evaluating the XQuery query on the given XML document.For the longest treks among those with difficulty moderate, return an element node labelled trek with i) attribute child name that contains the name of the trek and ii) an element child labelled rating that has the text of the rating of the trek as content.

Select the relation that best describes the graph given above.

raw the digraphs representing each of the relations.(a) R1 = {(a, a), (a, b), (b, c), (c, b), (c, d), (d, a), (d, b)}(b) R2 = {(1, 2), (1, 3), (1, 4), (2, 1), (2, 3), (2, 4), (3, 1), (3, 2), (3, 4), (4, 1), (4, 2), (4, 3)}(c) R3 = {(2, 4), (3, 1), (3, 2), (3, 4)}