I need this homework for tomorrow please

A) Write an algorithm to read string end with (*) and print it in reverse order B) Convert the following infix exp. To Postfix exp. Using the concept of Stack 1- a-b*(c+d)/(e-f)^g*h 2- y*m+(a^3/b-n)-d 3- m= x/6+(a-2*(b/3)^5+f)^2 4- (a>b) and ((e-c>a)or(g