Write a python program: Let the user specify S (the number of sides on a die) and N (the number of tosses of two S -sided dice). Assume ((S << N) and (3 <= S <= 20)). Since each die side is labeled with a unique integer taken from the range [ 1,S ], the sum of each dice toss is in the range [ (2=1+1),(2*S=S+S) ] . For example, when S = 6 , then the sum of each dice toss is in the range [ 2,12 ]. Make N dice tosses and count how frequently each sum occurs. Output a horizontal histogram that depicts the frequency distribution of the sums of the N dice tosses. Every sum in the range [ 2,2*S ] and its frequency of occurrence should be output using the format XXX (XXXXXXXX) | ****** where XXX is the sum, (XXXXXXXX) is the frequency, and each '*' represents 1% of the 100% of frequency distribution. The number of '*' output for each sum is computed by rounding the quotient (counts[sum]/N) up to the nearest integer. The entire histogram will contain (2*S-2+1) lines 2 (XXXXXXXX) | ****** 3 (XXXXXXXX) | ****** . . . . . . 2*S (XXXXXXXX) | ******

In PYTHON, write a code that allows the user to input two non-negative number sequences in increasing order (the numbers entered are always getting bigger, and no number repeats), both terminated by a -1. The size of each sequence can vary. The output of this code should be a third sequence that is a combination of both sequences 1 and 2 and is sorted in non-decreasing order.  Note: Non-decreasing order means there can be a repeated number in the third sequence (see example 1). A strictly increasing order sequence cannot have repeat numbers at all (see example 3). PLEASE do this using PYTHON, ONLY using while loops. NO language of "break", "len" or "True" please. Hint: we can use three separate lists to solve this code.