Write a function named splitStack that accepts as a parameter a reference to a Stack of integers,
and re-orders it so that all the non-negative numbers are at the top in the reverse of their original relative order,
and all the negative numbers are at the bottom in the reverse of their original relative order.
For example, if passed the stack {4, 0, -1, 5, -6, -3, 2, 7}, your function should modify the stack to store {-3, -6, -1, 7, 2, 5, 0, 4}.
Constraints: Do not declare any auxiliary data structures (e.g. arrays, Grids, Vectors, etc.) other than a single
Queue of integers.
