Given the following BNF

-> ?:

-> | +

-> id

a)Define an attribute grammar that enforces the following rules:

-id's type can be bool, int or float

-operands of + must be numeric and of the same type

-the type of + is the type of its operands

-the first operand of ?: must be of bool and the second and third must be of the same type

-the type of ?: is the type of its second and third operands

b)given your attribute grammar draw a decorated parse tree for " id ? id : id + id " assuming that the first id is of type bool and the rest are of type int