The postfix form of A*B+C/D is?*AB/CD+AB*CD/+A*BC+/DABCD+/*

The postfix form of the infix expression AB+C/D is ABCD/+.

Here's the step-by-step process:

1. Scan the infix expression from left to right.
2. If the scanned character is an operand, output it.
3. Else,
   • If the precedence of the scanned operator is greater than the precedence of the operator in the stack(or the stack is empty), push it.
   • Else, Pop the operator from the stack until the precedence of the scanned operator is less-equal to the precedence of the operator residing on the top of the stack. Push the scanned operator to the stack.
4. If the scanned character is an '(', push it to the stack.
5. If the scanned character is an ')', pop and output from the stack until an '(' is encountered.
6. Repeat steps 2-6 until infix expression is scanned.
7. Print the output
8. Pop and output from the stack until it is not empty.

So, for the given expression A*B+C/D:

• A and B are operands, so output them and place the * operator in the stack. The output is now AB*.
• C and D are operands, so output them and place the / operator in the stack. The output is now AB*CD/.
• • is an operator. It has less precedence than * and /, so pop all the operators from the stack and output them. The output is now AB*CD/+.

So, the postfix form of AB+C/D is ABCD/+.