int sum=0;
        for (int i=0;i<(ar.Count);i++)
        {
            sum+=ar[i];
            
        }
        return sum;

			public static int simpleArraySum(List<int> ar)
    {   
        int sum=0;
        foreach (int number in ar)
        {
            sum += number;
            
        }
        return sum;
    }

public static int simpleArraySum(List<Integer> numbers) {
    int sum = 0;
    
    //Iterate through all numbers to calculate sum
    for(int number : numbers) {
        sum += number;
    }
    return sum;
}

public static int simpleArraySum(List<Integer> numbers) {
    // Caculate sum using reduce
    return numbers.stream()
                .reduce(Integer::sum)
                .get();
}

public static int simpleArraySum(List<Integer> numbers) {
    // Base case: checking if the current list is empty
    // return 0
    if(numbers.isEmpty()) return 0;
    
    // Get the last element of the list
    int currentNumber = numbers.get(numbers.size() - 1);
    
    // Remove the current number from the list
    numbers.remove(numbers.size() - 1);
    
    // Recursive call: sum the current number and
    // the rest elements.
    return currentNumber + simpleArraySum(numbers);
}