Write recursive function that reverses a string (for example "time" becomes "emit") a. (Use only core JavaScript.) b. Don't use any reverse or sorting functions

Write recursive function that as an argument gets n and calculates what is corresponding number in n place in Fibonacci sequence For example f(8) = 21 (Fibonacci sequence for example: 0,1,1,2,3,5,8,13,21,34,55….) a. Discuss performance of the function with large n number. What are pitfalls? How function can be optimized. b. Bonus: write function complexity of space and time.

Write function that get an array and bubble sort it