The length of the longest common prefix of two strings 𝑠=𝑠1𝑠2…𝑠𝑛 and 𝑡=𝑡1𝑡2…𝑡𝑚 is defined as the maximum integer 𝑘 (0≤𝑘≤𝑚𝑖𝑛(𝑛,𝑚)) such that 𝑠1𝑠2…𝑠𝑘 equals 𝑡1𝑡2…𝑡𝑘. Koa the Ko