JAVA language!

Activity # 1: Apply insertion sort & Binary Search We know that we must have a sorted list in order to utilize Binary Search. Write out the application of Insertion Sort (in step-by-step format) to each of the 3 unsorted arrays of integers. Then apply Binary Search (in step-by-step format) on the now-sorted arrays to locate the given target. Don't worry about including your solutions as part of your submission Target 3; Array [9, 6, 4, 3, 0, 10, -2) Target 1; Array 7, 8, 4, 4, 10, 25) Target 17; Array (1, 2, 3, 4, 0, 17, 8, 9, -5, 10