Write an algorithm for finding the smallest number from a given array of $n$ numbers $($where $n3).$ Additionally, answer the following questions,

a$.$ Analyze the complexity of your algorithm.

b$.$ Explain how you should set up the problem to make sure your algorithm will never return "not found" or $"-1"$