Assume you are given an array. Each element in the array corresponds to the weight of a coin in the treasure. All the coins have the same weight except one (the counterfeit coin). The counterfeit coin is lighter than the other coins. Your aim is to determine the position of the counterfeit coin in the array and how much lighter it is as compared to the other coins. For comparing weights, you can only use the given balance scale. You can put any number of coins on two sides of the scale. The balance scale can be implemented as a function which takes two arguments, 1) coins on the left side and 2) coins on the right side, and returns which side of the balance is lighter. If required, you can have more arguments in this function.

The command line arguments will be used to define the weights of the coins. The first argument is the number of coins in the treasure. Let the number of coins be k. The next k inputs correspond to the weight of the coins. Ensure proper sanity checks for correct input. Print â€śWrong Inputâ€ť for invalid input.

In this assignment, you will implement several algorithms to solve this riddle. At every step, your algorithm should output the weights placed on both the sides of the scale. The elements should be processed in the array order. The last line of the output should be the index of the counterfeit coin and the weight difference. Sample inputs and outputs have been shown for a few test cases.

Algorithm#1: Pairwise Comparison

Keep comparing the pair of elements one by one. As soon as you find an element with lesser weight, return its index and the weight difference.

Sample Input#1:

7 5 5 5 5 2 5 5

Output:

5 5

5 5

2 5

4 3

Sample Input#2:

5 5 5 5 5 2

Output:

5 5

5 5

4 3