Write some Software

Q 1: Write a program to convert an infix expression that includes (, ), +, -, *, and / to postfix using i) Stack class from Java collection API ii) Your own Stack class, you created in Week 4 class work. Q 2: Queue implementation using fixed size arrays (minimum 15 elements and maximum 50 elements). Write your own queue class that implement enqueue( ), front( ), dequeue( ), isEmpty( ), toString( ) and size( ) methods. Q 3: Write a program to encode and decode a message using repeating key method (create a key of your choice). Repeating key should be stored in a queue both for encoding and decoding. For queue use your own class created in question 2