Problem op.3 - Analysis

General Game Playing

For each of the rules shown below, select the expression that captures the worst case complexity of our standard evaluation algorithm without indexing. The symbol n represents the total number of objects in the domain.

`r(X,Y) :- p(X,Y) & q(Y) & q(Z)`
		n⁴ + n³ + n² + n
		2n⁴ + 2n³ + n² + n
		2n⁴ + 2n³

`r(X,Y) :- p(X,Y) & q(Y)`
		n⁴ + n³ + n² + n
		2n⁴ + 2n³ + n² + n
		2n⁴ + 2n³