For the following pseudo-code of a recursive program mod that computes a mod b given a, b as inputs, trace the stack contents during the execution of the call mod (23, 7).  procedure mod (a, b)  if (a < b) then mod := a  else  { x := a − b 1  : mod( , ) 1 1 y = x b  mod:= 1 y  }  end mod

Given a stack, a function is consecutive takes a stack as a parameter and thatreturns whether or not the stack contains a sequence of consecutive integersstarting from the bottom of the stack (returning true if it does, returningfalse if it does not). For example:bottom [3, 4, 5, 6, 7] topThen the call of is_consecutive(s) should return true.bottom [3, 4, 6, 7] topThen the call of is_consecutive(s) should return false.bottom [3, 2, 1] top The function should return false due to reverse order. Note: There are 2 solutions:first_is_conse cutive: it uses a single stack as auxiliary storagesecond_is_cons ecutive: it uses a single queue as auxiliary storage