You are given a stack of 100 cards. On each card is written a positive number between 1 and 100. Define an algorithm that you would use to find the largest number in the stack. Make sure that your algorithm is clear and unambiguous. Identify any selection or repetition in it. Represent the algorithm using pseudocode. The cards in the stack would look somewhat like the following: 1 27 5 n The actual numbers written on the cards are not important for your algorithm. What is important is that they are equal or greater than 1, no number is repeated, and the cards are not sorted in any way