Given the following attribute grammar.: Syntax rule: Semantic rules Syntax rule: Semantic rule: Syntax rule: Semantic rule: Syntax rule: Semantic rule: Syntax rule: Semantic rule: Syntax rule: Semantic rule: Syntax rule: Semantic rule: Syntax rule: .type .type (inherited) .type .type (inherited) .value .value (inherited) binary .type = binary decimal .type decimal [1] [2] [1].value if [1].type = decimal = .value = 1 [2].type [1].type .value .value (synthesized) 1 0 .value = 0 then [2].value * 10+ .value else [2].value * 2 + .value A|B|C Given the input string "binary A = 110011" a. Draw the parse tree. b. Draw the attribute dependency tree that shows the associated attributes at each node of the parse tree and their dependency relationships with attributes at other nodes. c. Show the order of attribute evaluation according to the attribute dependencies. d. Draw the fully attributed tree with evaluated attribute values at all nodes. Note: do the above steps on a single tree.