A recursive function rec is defined by 0 rec(n) = 1 rec(n-1) +rec(n-2)*rec(n-3) n<1 n=2 n> 3 Following the Fantastic Four Approach, write a recursive program (a set of rules) in Prolog to define the solution to this function by selecting the lines of code. = ✓ [Select] rec (N =< 1, R is 0). rec (N, R) :-N =< 1, R is 0. rec (N, R), where N =< 1, R is 0. rec (N, R) -> N =< 1, R is 0. 2 ✓ [Select ] rec (N, R) :-N =:= 2, R is 1. rec (N, R) :-N == 2, R is 1. rec (N, R) :-N =!= 2, R is 1. rec (N, R) -> N =:= 2, R is 1. rec (N, R), where N == 2, R is 1. ✓ [Select ] rec (N, R) :-N >2, (N - 1, R):- N>2, rec (N, R-1) :-N>2, rec (N - 1, R - 1) :- N> 2, rec ✓ [Select ] N1 is N-1, N2 is N-2, N3 is N-3, N1 is N-1, N2 is N-2, N2 is N-2, N3 is N-3, N1 is N-1, N2 is N-2, N3 is N-3, ✓ [Select ] rec (F1, N1), rec (F2, N2), rec (F3, N3), rec (F1, N1), rec (F2, N2), rec (F3, N3), rec (F1, N1), rec (F2, N2), rec (F2, N2), rec (F3, N3), rec (F1, N-1), rec (F2, N-2), rec (F3, N-3), ra Select ✓ [ Select ] F == F1 + F2 * F3. F =:= F1 + F2 * F3. F = F1 + F2 * F3. F is F1 + F2 * F3. bul * Select How many size-m problems should this program have? [ Select ]