We have 11 chain letters, labeled "A" through "K. We want to complete a distance matrix that records the "distance" between any pair of chain letters. Compute the distance between two chain letters by scoring the differences between them at 8 key points: "New England" 0 if the same, 1 otherwise "R.A.F.Officer" 0 if the same, 1 otherwise. "Gene Welch" 0 if the same, 1 if one name different, 2 if both different. "Saul de Groda" 0 if the same, 1, 2 or 3 if 1, 2 or 3 names different or added "Constantine Dias" 0 if the same, 1 or 2 if 1 or 2 names different "Carlos Daddit" 0 if the same, 1 or 2 if 1 or 2 names different "Dalan Fairchild" 0 if the same, 1 or 2 if 1 or 2 names different "a young woman in California" 0 if both letters have or don't have this part, 5 if one does and one doesn't. The distance between the two chain letters is the sum of the 8 scores. Each person is only responsible for ONE ROW of the following table. Use this table to record the distances between chain letters. __A__ __B__ __C__ __D__ __E__ __F__ __G__ __H__ __I__ __J__ __K__ __A__ ..0.. ..... ..... ..... ..... ..... ..... ..... ..... ..... ..... __B__ ..... ..0.. ..... ..... ..... ..... ..... ..... ..... ..... ..... __C__ ..... ..... ..0.. ..... ..... ..... ..... ..... ..... ..... ..... __D__ ..... ..... ..... ..0.. ..... ..... ..... ..... ..... ..... ..... __E__ ..... ..... ..... ..... ..0.. ..... ..... ..... ..... ..... ..... __F__ ..... ..... ..... ..... ..... ..0.. ..... ..... ..... ..... ..... __G__ ..... ..... ..... ..... ..... ..... ..0.. ..... ..... ..... ..... __H__ ..... ..... ..... ..... ..... ..... ..... ..0.. ..... ..... ..... __I__ ..... ..... ..... ..... ..... ..... ..... ..... ..0.. ..... ..... __J__ ..... ..... ..... ..... ..... ..... ..... ..... ..... ..0.. ..... __K__ ..... ..... ..... ..... ..... ..... ..... ..... ..... ..... ..0..