problem 1)a) prepare the algorithm to convert a given infix expression to its postfix form.

b) Covert the following expression to its postfix form using the above algorithm.

A*(B+D)/E-F*(G+H/K)

problem 2)a) Describe the problems associated with linear queue and also state the solutions to the problem.

b) prepare C functions to perform the following operations on a circular queue( using arrays):

1. Insert from rear end.

2. Delete from front end.

problem 3)a) prepare the c function to create an ordered linked list.

b) prepare the recursive function to compute GCD of two numbers.

c) prepare the algorithm to perform evaluation of an postfix expression.

problem 4)a) prepare a program to add two long positive integers (length of two integers need not be same and can be of any length) using singly linked list. prepare functions to perform the following:

i) Reading an long integer.

ii) Addition of long integers.

iii) Display the long integer.

b) Describe the following terms associated with trees with an ex for each.

i) Depth of the tree

ii) Binary search tree

iii) Almost Complete binary tree

iv) Strictly binary tree