Task $3$: Write a program to add two lists index$-$wise. Create a new list that contains the $0^{th}$ and $1^{st}$ indices items from both the list, then the $2^{nd}$ and $3^{rd}$ indices items, and so on till the last elements. Any leftover items will get added at the end of the new list. For example: given the following lists as input:

list $1=[M,n,a,i,K,e]$

list $2=[y,m,e,s,l,y,h,e]$