Question 3: Tree Traversal (20%) You are given the inorder traversal and the postorder traversal of a binary tree. Write a program to output the corresponding preorder traversal. All nodes only contain a unique number ranging from 0 to 200. Your program should read the input from the file, and output the answer to another file. The first argument is the input file name, while the second argument is the output file name. Name your program as lab5-q3.c". Hint: You need not build the tree. You may need a stack for solving this question. Input file: First line, an integer n, indicating the number of nodes in the tree. Second line, n integers separated by a space, indicating the inorder traversal. Third line, n integers separated by a space, indicating the postorder traversal. Output file: A line of n integers separated by a space, indicating the preorder traversal. Sample Input: 3 2 1 3 2 3 1 Sample Output: 1 2 3