These files must not be in compressed format. • It is your responsibility to check and make sure that you have uploaded both the correct files. • Zero mark will be given if you try to bypass the SafeAssign (e.g. misspell words, remove spaces between words, hide characters, use different character sets, convert text into image or languages other than English or any kind of manipulation). • Email submission will not be accepted. • You are advised to make your work clear and well-presented. This includes filling your information on the cover page. • You must use this template, failing which will result in zero mark. • You MUST show all your work, and text must not be converted into an image, unless specified otherwise by the question. • Late submission will result in ZERO mark. • The work should be your own, copying from students or other resources will result in ZERO mark. • Use Times New Roman font for all your answers. Question One Pg. 01 Learning Outcome(s): Demonstrate implemented solution with appropriate data structure and algorithm for the assigned problem. Question One 3 Marks Design an algorithm to find the largest number among three numbers. Question Two Pg. 02 Learning Outcome(s): Describe basic and advanced data structures such as linked lists, stacks, and queues. Question Two Compare an array and a linked list according to A. Definition B. Size C. Access to an element D. Insertion and deletion operations 3 Marks Question Three Pg. 03 Learning Outcome(s): Demonstrate implemented solution with appropriate data structure and algorithm for the assigned problem Question Three 2 Marks Convert the infix expression to a postfix expression.