//computes and returns the number of times an element in an rray is strictly larger than the immediately preceding element.

//Pre: data[0:dataSz-1] have been initialized

//Examples:

//{3, 5, 4, 7, 11, 10, 22] -> 4

// {5, 6, 7, 7, 3, 9, 7} -> 3

//{13} -> 0

int numStepsUp(int data[], int dataSz) {

int numUps = ____;

int idx = _____;

while( ________){

if ((data[idx-1] < data[idx]){

numUps++;

_______

}

_______

}

return numUps;

}