1. Compare two criteria or characteristics using Visual Basic and Visual C++.Readability. Visual Basic is a programming language that can be easily read. Most of the constructs resemble simple English words and phrases. It also has a low multiplicity of functionality. To increment a variable you need to write: i = i + 1. Visual C++ has several ways to do this although with slightly different meanings: i = i + 1 or i +=1 or i++ or ++i. This reduces the readability of Visual C++. Visual Basic still retains the 'goto' statement that allows unconditional jumping to a labeled line of code. If used improperly, it can lead to unstructured programming and decreased readability. Overall, Visual Basic has greater readability than Visual C++.Writability. Visual C++ allows for greater expressiveness when writing code. As in the previous example, incrementing a value can be done in several ways. Implementing a binary tree in Visual C++ comes naturally with the use of pointers. While this can be achieved in Visual Basic with the use of references, it is more complicated. Overall, Visual C++ has greater writeability than Visual Basic.2. Assign an advantage and a disadvantage for each of the following linguistic characteristics:◦ Generality – advantage: a language with high generality can be used in a wide range of applications; disadvantage: a language with high generality may be more difficult to use in a specific application domain than a language built with that domain in mind◦ Aliasing – advantage: allows greater flexibility in writing code; disadvantage: can increase the possibility of program errors when the value pointed to by two references is changed.◦ Type checking – advantage: if type checking is performed at compile time, possible errors are detected... half of the paper. .. ....r op;expression term1, term2;}9. Draws the abstract syntax tree of the following assignment expression: x = y + 1StatementAssignmentVariable Statementx BinaryExpressions Operator ExpressionsValue op Valueterm1 term210. With an example, show that the following BNF is ambiguous. Show at least 2 different parse trees-> |->-> + | -Example 1:=>=> +=> +=> + +=> a + + < id>=> a + b + cExample 2:=>=> +=> + < id>=> + + c= > + < id> + c=> a + b + cTwo separate parse trees for the same sentence, a + b + c. The BNF is ambiguous.