Consider a situation where you need to write a recursive function void reverse that reverses a string. Suppose your recursive solution removes the first character, reverses the string consisting of the remaining text, and combines the two. Which of the following would be a technique that may produce an easier solution?

Question $5$ options:

Introduce a helper function that performs string concatenation.

Introduce a helper function that reverses a substring of the original string.

Introduce a helper function that removes the first character of a string.

Write an iterative function that traverses each character in the string.