Consider the following predicate logic program, in which P and Q are unary predicate symbols, R,S, and T are binaty predicate symbols, d,b, c, df constant symbols, and x and y are variables: - T(x,y),S(x,y),notQ(x)R(x,y) - P(x),Q(y)S(x,y) T(a,b) T(b,c) T(b,d) - P(a) - P(b) - Q(a) - Q(d) Which of the following statements is true, given the following assumptions: - the first (leftmost) query atom is always chosen for resolution; - the first (topmost) listed rule or fact that matches is chosen for resolution; - in the event of failure, backtrack to last choice point and choose next rule or fact that matchus. (i) Does the query ? R(x,y) succeed or fall? The query succeeds. The query fails. (ii) Enter how many times the procedure is required to backtrack to a choice point on the query ?R(x,y)?(eg,0,1,2,)