What is the space complexity of the following code, where the list size is 5? Function FindFirstGreaterThan(integer array(?) list, integer value) returns integer foundValue integer i foundValue = value for i = 0; (i < list.size) and (foundValue == value); i = i + 1 if list[i] > value foundValue = list[i] Group of answer choices S(N) = 5 S(N) = N + 5 S(N) = 3 S(N) = N + 3