JAVA PROGRAMMING(DATA STRUCTURES and ALGORITHMS): Q1) Develop two (2) different algorithms on how to get the sum of integers from 1 to n

JAVA PROGRAMMING(DATA STRUCTURES and ALGORITHMS): Q1) Develop two (2) different algorithms on how to get the sum of integers from 1 to n. Compare the processes and analyze which among the two algorithms is better in terms of space and time complexity.

Q2)Develop a code that will insert a value in the nth index of an array of Strings. Print the elements before and after the insertion. All elements of the array must be inputted.

Q3)Develop a code that will search for a value in a two-dimensional array of integers. The array has a dimension of 4 x 5. Assign initial values to your array. 

Q4)Develop a code that stores ten (10) book ID and ten (10) book titles in parallel arrays. Then, accept a book ID that will be searched from the list of books. Display the book ID and the title once found, otherwise, display an appropriate message. Implement the linear search algorithm.

Q5)Modify your code in number 1 and apply binary search algorithm.