Answer the following coding questions in Python. ## 1) Implement factorial Implement a function `factorial(n)` that returns \(n!\) for a non-negative integer `n`. - Describe at least two different implementation approaches (e.g., iterative, recursive), and discuss constraints (e.g., recursion depth, large integers). ## 2) Count trailing zeros of a factorial Given an integer `n`, compute the number of trailing zeros in the decimal representation of \(n!\) (i.e., how many zeros at the end). - Your solution should be efficient for large `n` (do **not** compute \(n!\) explicitly). - Specify time complexity.

def solution(n):
    result = 1
    for i in range(2, n + 1):
        result *= i
    return result