Please solve using Java and write a fully answered, optimized, and detailed code with comments and screenshots along with an approach on how to solve it and why that approach, and time/space complexity along with the why. Also, please use the example code provided as well. Thanks. Java Example Code:

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.nio.charset.StandardCharsets;

public class Main { /** * Iterate through each line of input. */ public static void main(String[] args) throws IOException { InputStreamReader reader = new InputStreamReader(System.in, StandardCharsets.UTF_8); BufferedReader in = new BufferedReader(reader); String line; while ((line = in.readLine()) != null) { System.out.println(line); } } }

Add Number Series Programming challenge description: Write a program that, given an integer, sums all the numbers from 1 through that integer (both inclusive). Do not include in your sum any of the intermediate numbers (1 and n inclusive) that are divisible by 5 or 7. Input: Your program should read lines from standard input. Each line contains a positive integer. Output: For each line of input, print to standard output the sum of the numbers from 1 through n, disregarding those divisible by 5 and 7. Print out each result on a new line. Test 1 Test Input 10 Expected Output 33 Test 2 Test Input 7 Expected Output 16