Write an assertion that the numbers in AA are in a jagged order, that is, each subsequent number in the array must be alternatingly larger or smaller than the previous. For example the arrays [0,1,0,2,1,4,3][0,1,0,2,1,4,3] and [5,2,3,2,6][5,2,3,2,6] are both jagged, while [0,1,2,1,0][0,1,2,1,0] and [0,1,0,1,1,1,0][0,1,0,1,1,1,0] are not jagged. Reminder: an assertion is not the same thing as a definition.

Don't say anything that will offend her, make her feel better and talk about happ things.

Answerreading,math,and sentence skills;

Choice 2.the algorithm constantly checks to see if the value in the position before is greater than the value in the current position. if there is even one instance, it will return false and stop looping.using an if-statement without } and { means that the if-statement true condition only applies for the next lineconsider  . the condition  checks if previous position is greater than or equal to current position. if it is, it will make method return false. for that example, it won't.consider  , it would return falseconsider  . it would return false