Write the code in Java or C and provide time complexity analysis to prove the algorithm is O(log n) time complexity.

Lists, Stacks, and Queues 1. For a given sorted list (ascending order) and a target number, find the first index of this number in O(log n) time complexity. If the target number does not exist in the list, return -1. Example 2: Input: [1, 2, 3, 3, 4, 5, 10], 3 Output: 2 Explanation: the first index of 3 is 2