Suppose L = (f1, f2, 9, Ø, c) is a first-order language where f1, f2 are binary function symbols, g is a unary function symbol, o is a binary predicate symbol and c is a constant symbol. Consider the...

Please give correct answer for a, b and c. Thanks.

Extracted text: Suppose L = (f1, f2, 9, Ø, c) is a first-order language where f1, f2 are binary function symbols, g is a unary function symbol, o is a binary predicate symbol and c is a constant symbol. Consider the usual structure of the number theory as an L-structure N = (N,+, x, S, <,0) by="" the="" following="" interpretations:="" fª="" is="" +="" (the="" addition="" function),="" f="" is="" x="" (the="" multiplication="" function),="" g"="" is="" s="" (the="" successor="" function),="" o"="" is="">< (the="" usual="" order="" relation)="" and="" c"="" is="" the="" number="" 0.="" (a)="" what="" is="" the="" interpretation="" of="" the="" term="" fi(g(g(c)),="" f2(g(x),="" y))="" in="" n,="" where="" x"="" is="" 2="" and="" y"="" is="" 3?="" show="" your="" work.="" (b)="" find="" the="" value="" of="" the="" a",="" where="" a="" is="" the="" l-formula="" (3x)(vy)f2(x,y)="y." (c)="" write="" an="" l-formula="" b(x)="" with="" a="" free="" variable="" x="" such="" that="" n="B(n)" iff="" n="" is="" an="" odd="">