6. Write a pseudocode that computes for the values of the factorial of a number. (Note: 5! = 5*4*3*2*1, or 5! = 1*2*3*4*5). Also consider O! = 1 (by mathematical definition), and the factorial of a negative number doesn't exist. 7. A. List at least 6 algorithms that sorts a long list of numbers. B. Choose two (2) algorithms among the list and write the pseudocodes for them. C. Simulate each pseudocode for the following numbers: {3, -6, 1, 0, -6, 10, 8, 2, -4, -7,-5, -6, 2} and compare (i) the length of the code and (ii) the time to finish the simulation