Question 9: Ever since he was a child, Nick1 has been dreaming to be like Spiderman. As you all know, Spiderman can climb up the outside of a building; if he is at a particular floor, then, in one step, he can move up several floors. Nick is not that advanced yet. In one step, Nick can move up either one floor or two floors Let n 2 1 be an integer and consider a building with n floors, numbered 1,2,... ,n. (The first floor has number 1; this is not the ground floor.) Nick is standing in front of this building, at the ground level. There are different ways in which Nick can climb to the n-th floor. For example, here are three different ways for the case when n -5: move up 2 floors, move up 1 floor, move up 2 floors move up 1 floor, move up 2 floors, move up 2 floors move up 1 floor, move up 2 floors, move up 1 floor, move up 1 floor Let Sn be the number of different ways, in which Nick can climb to the n-th floor. . Determine, S1, S2, S3, and . Determine the value of Sn, i.e., express Sn in terms of numbers that we have seen irn S4 class. As always, justify your