<prompt> apple, orange, strawberry, car, airplane, mouseAndika kazi ya aina ambayo inachukua safu na kuiweka katika O 1.  <response>: Unfortunately, its not possible to sort an array in O1 time complexity. The best possible time complexity for sorting an array is On log n using algorithms like merge sort, quick sort, or heap sort. However, you can sort the given array using the built-in sort method in JavaScript like below:const arr apple, orange, strawberry, car, airplane, mouse;arr.sort;console.logarr; airplane, apple, car, mouse, orange, strawberry 