Why do we only care about the number of repeated steps for calculating big o (in other words, why is it okay to ignore steps that are outside of loops, or steps that only occur once inside of a loop)? From the in-class examples, it is clear that using recursion does not necessarily lead to an efficient algorithm. In fact, a recyrsive solution is never more efficient than an iterative (non-recursive) solution to the same problem (at least in Java). So what is the purpose of using recursion? Write the code to define an insert(...) method that takes an array of integers as an argument, an integer that is to be inserted, and the index where it is to be inserted. The method should return an array with the insertion performed. Write the code to define a remove(...) method that takes an array of characters as an argument and the index of a character that is to be removed. Return an array with the removal performed