Please help me with this question. I would really appreciate it.

Determine the worst-case running time of the following functions, using big-O notation. Notes: Make your bound as tight as possible. Define any variables you use in your expression. Show your work by describing the running time of each line. Assume that inputs provided will allow all methods will run without error You may want to add debug statements and execute the code to see if the count of operations is consistent with your answers. void baz(int[] data) int index-0 while (index >- 0) { data[indexdata[index]1: index data[index]