Different search algorithms can return different solutions. How do you determine the optimal one?

Group of answer choices:

$1)$ The optimal solution is the one that reaches the goal in the fewest steps or actions, regardless of the computational resources used during the search process.

$2)$ The optimal solution is the one that minimizes the total cost of reaching the goal, considering both path length and the specific costs associated with traversing individual nodes or edges.

$3)$ The optimal solution is the one that uses the least amount of memory while searching, as memory efficiency is often the primary concern in large$-$scale problems.

$4)$ The optimal solution is the one that explores the fewest nodes, ensuring the search process was the most efficient in terms of time complexity.