Please write Java codes to solve the following questions. The submissions should be your answers, source codes and screen-shots of the program results. 6. Algorithm A executes an O(logn)-time computation for each entry of an array storing n elements. What is its worst-case running time? (5 points) Please write Java codes to solve the following questions. The submissions should be your answers, source codes and screen-shots of the program results. 6. Algorithm A executes an O(logn)-time computation for each entry of an array storing n elements. What is its worst-case running time? (5 points)