QUESTION 1 Consider a noa erapty Python list vanable called nanes uhich cotairs strings. Below iz inccemplete code which is ntended to print the length of the longest string in the list names. Te cade is Three ways to do this are: pposed to yt thr ht e the arible beat tokerm tuk of tiinet name 8eeEt (I) remembes the name using the vaniable beat C) resember the natre positboo in the list usingte able best, or E) remember the length of the name using the variable bept. Each bos containt a mumber of optional labelled lines of code whica would be used for the impleameanatons abore. Taey aze not in aey particolar order. TASK isto first ma ea chce about which mp ementation vouw tdoes n trat ru use lei) Thm det mina u, e nation ofli ei ofcode wil ca te the print the length of the longest string in the list en de t is Either:Ka)0 or:) names t0 for index in range (Len (names)):i Either:aen (best) if len (names index> or:b)llilen (nameg betI) or: (c)best bestEither: fanamesindex b) linde ore) ien (names lindex]) Either: aen (names Ibestl) print or b)lILen (bect) one of the combinations bel