10. [10 points) For this question, please take a look at the sheet that is attached to this exam and summarizes our use of algorithms and pseudocode in this class. You may also want to review sections 3.1, 5.4, and Appendix 3 page A-11 in our textbook. (a) Write out an algorithm in pseudocode that computes the sum 1+2+3++(n-1)+n (b) write out an algorithm in pseudoode that computes the surn 13 +3 ++ (2n-3), (2n-1) (c) Write out a recursive algorithm in pseudocode that computes the term Ln of the Lucas sequence, which was defined in question 6. (d) Write out an algorithm in pseudocode that computes the sum 25 5.8 8-11 (e) Write out a recursive algorithm in peudocode that computes the ternm T, of the tribonaci sequence which was defined in question 8. 10. [10 points) For this question, please take a look at the sheet that is attached to this exam and summarizes our use of algorithms and pseudocode in this class. You may also want to review sections 3.1, 5.4, and Appendix 3 page A-11 in our textbook. (a) Write out an algorithm in pseudocode that computes the sum 1+2+3++(n-1)+n (b) write out an algorithm in pseudoode that computes the surn 13 +3 ++ (2n-3), (2n-1) (c) Write out a recursive algorithm in pseudocode that computes the term Ln of the Lucas sequence, which was defined in question 6. (d) Write out an algorithm in pseudocode that computes the sum 25 5.8 8-11 (e) Write out a recursive algorithm in peudocode that computes the ternm T, of the tribonaci sequence which was defined in question 8