$1.$ Write the following expression in postfix $($reverse Polish$)$ notation. Remember the rules of precedence for arithmetic operators! X $=$ A $$ B $+$ C $*($D $*$ E $$ F$)$ Write a program to evaluate the above arithmetic statement using a stack organized computer with

a$)$ zero$-$address instructions $($so only pop and push can access memory$).$

b$)$ One$-$address

c$)$ Two$-$address

d$)$ Three$-$address

$2.$ In a computer instruction format, the instruction length is $11$ bits and the size of an address field is $4$ bits. Is it possible to have:

a$)52-$address instructions

b$)451-$address instructions

c$)320-$address instructions using the format? Justify your answer.

$5.$ What are sources of overhead in a parallel program?

$6.$ List and describe Flynn$$s taxonomy on the different computation models.