Need help with quesitons:

1).Create a program in C++ or C# that forces one data type to be converted into another (using explicit type conversion). Show the Source code.

2)Do you think the elimination of overloaded operators in a language would be beneficial? Why or why not

3)Assume the following rules of associativity and precedence for expressions:

Precedence:

Highest *, /, not+, , &, mod(unary)=, /=, <,<= , >=, >and

Lowest or, xor

Associativity Left to right

Show the order of evaluation of the following expressions by parenthesizing all subexpressions and placing a superscript on the right parenthesis to indicate order.

For example, for the expression a + b * c + d

the order of evaluation would be represented as

((a + (b * c)1)2 + d)3

a. a * b1 +c

b. a * (b1) / cmod d

c. (ab) / c & (d * e / a3)

d. -a or c = d and e

e. a > b xor c or d <= 17

f. -a + b

Now show the order evaluation of the expression (in a thru f), assuming that there are no precedence rules and all operators associate right to left.