Complete the function to return the sum of numbers between the given indexes in an array (inclusive). We could check these indexes ahead of time, but instead, just use a try-catch block to check for an . If this occurs, println "BAD INDEXES" and return 0 instead.

How do i solve this problem using java?

The value of sin(x) (in radians) can be approximated by the alternating infinite series create a function (prob3_2) that takes inputs of a scalar angle measure (in radians) and the number of approximation terms, n, and estimates sin(x). do not use the sin function in your solution. you may use the factorial function. though this can be done without a loop (more efficiently), your program must use (at least) one. you may find the mod() function useful in solving the problem.