Prolog

II1.2 A recursive function rec is defined by 0 rec(n) n=2 rectn-1)+ rec(n-2) rectn-3) 23 Following the Fantastic Four Approach to write a to this function. You must use comments to mark the code that recursive program (a set of rules) in Prolog to define the solution represent each of the four steps of the approach. II1.2 A recursive function rec is defined by 0 rec(n) n=2 rectn-1)+ rec(n-2) rectn-3) 23 Following the Fantastic Four Approach to write a to this function. You must use comments to mark the code that recursive program (a set of rules) in Prolog to define the solution represent each of the four steps of the approach