<prompt> Kwa kuwa na safu mbili za kamba list1 na list2, pata kamba za kawaida zilizo na jumla ya faharisi ya chini. Kamba ya kawaida ni kamba ambayo ilionekana katika orodha1 na orodha2. Kamba ya kawaida yenye jumla ya faharisi ya chini ni kamba ya kawaida ambayo ikiwa ilionekana kwenye orodha1i na orodha2j basi i j inapaswa kuwa kiwango cha chini kati ya safu zingine zote za kawaida. Rudi safu zote za kawaida zilizo na jumla ya faharisi ya chini. Rudi jibu kwa utaratibu wowote.  <response>: To solve this problem, we can first create a dictionary to store the indices of each string in list1. Then, for each string in list2, we can check if it appears in the dictionary and calculate the index sum. If the index sum is smaller than the current minimum index sum, we update the result list. Here is the Python code to implement this algorithm:def findRestaurantlist1, list2: index word: i for i, word in enumeratelist1 min_sum floatinf result for j, word in enumeratelist2: if word in index: if j indexword min_sum: min_sum j indexword result word elif j indexword min_sum: result.appendword return resultFor example, if we have list1 Shogun, Tapioca Express, Burger King, KFC, and list2 KFC, Shogun, Burger King, then the function would return Shogun because the index sum of Shogun is 1 1 2, which is the smallest among all common strings. 