Que Jon $1$

Given in strings each of length k$.$ How marry strings of length con

formed

th character of output string comes from ith input string

For n$=2,$ k$=3$

input strings: 'abc' 'qwe'

output strings: $\text{'}$aq$\text{'},\text{'}$aw$\text{'},\text{'}$ae$\text{'},\text{'}$bq$\text{'},\text{'}$bw$\text{'},\text{'}$be$\text{'},\text{'}$cq$\text{'},\text{'}$cw$\text{'},\text{'}$ce$"$

Please write answer in terms of n and k

Your answer