You are given N numbers and you have to determine total possible ways to arrange them such that N1<N2>N3<N4>N5<N6> < N2 > N3 < N4 > N5 < N6 > N7....so on.N1,N2 are the numbers of the list.The interviewer didn't specify the constraints and asked instead for best possible solution.How to solve it?