Given an array A of positive integers, provide an algorithm that finds the largest odd number that is a sum of some array elements. Each value A$[$i$]$ can be included once or not be in the sum. In all the algorithms, always explain them and analyze their time complexity. The complexity should be as small as possible.