Complete the #TODO portion of the Python program pattern$\_$nbrs$.$py$,$ given below, for it to display the pattern shown below for n $=5,7$ and $8$ respectively. The modification must be restricted to and only to the #TODO portion. No modifications shall be made to the provided code.The expected input$/$output behavior of the program is illustrated by the following examples:

Enter a positive integer: $5$

$000$

$10011$

$2001111$

$300111122$

$40011112222$

Enter a positive integer: $7$

$000$

$10011$

$2001111$

$300111122$

$40011112222$

$5001111222233$

$600111122223333$

Enter a positive integer: $8$

$000$

$10011$

$2001111$

$300111122$

$40011112222$

$5001111222233$

$600111122223333$

$70011112222333344$

The Python program is shown below:

#TODO

n $=$ int$($input$("$Enter a positive integer: $"))$

for i in range$($n$)$:

s $="0"$

flag $=$ False

k $=0$

for j in range$(0,$i$+1)$:

k $=$ fmap$($k$,$flag$)$

s $=$ s $+$ str$($k$)$

#TODO

print$($i$,$s$)$

Complete #TODO portions of the program without changing anything else in the program. I need you to fill out both #TODO portions since the last solution you gave me was incompleted.

The output of the program i should be getting and I enter a positive integer for example lets say $5$ should be:

$000,10011,201111,300111122,40011112222.$ After each iteration the numbers in the output have to increase by $2$ each time I enter a psotive integer. Since it starts off at digits and then $1$ with digits and goes up by $2$ each time. How do I implement this in my program for the output to look what I said above?