[ sum_{i=1}^{n} i+rac{n !}{(n-1) !} ] Where ( sum ) denotes the summation operation, and .( n ) ! represents the factorial of ( n ) Write an efficient algorithm to calculate ( F(n) ). You should write pseudocode (1 State the time complexity of your algorithm using Big-O notation (2 :Notes Your score for this question will be proportional to the efficiency of your algorithm. The most efficient solution will receive full marks Avoid redundant calculations and focus on reducing the algorithm's overall computational complexity

i=1ni+(n1)!n! Where denotes the summation operation, and n ' represents the factonal of n Write an efficient algorithm to calculate F(n). You should write pseudocode (1 State the time complexity of vouraigorithm using Big.O notation 12 Notes Your score for this question will be proportional to the efficiency of your algonthm. The most elficient solution will receive full marks Avoid redundant calculations and focus on reducing thalgonthn's overall computational complexty