Unit 8: Algorithms - Assignment
Total points for Assignment: 35 points. Assignments must be submitted as a Microsoft Word document and uploaded to the Dropbox for Unit 8. All Assignments are due by Tuesday at 11:59 PM ET of the assigned Unit.
NOTE: Assignment problems should not be posted to the Discussion threads. Questions on the Assignment problems should be addressed to the instructor by sending an email or by attending office hours.
You must show your work on all problems. If a problem is worth 2 points and you only show the answer, then you will receive only 1 point credit. If you use a calculator or online website, give the source and tell me exactly what you provided as input. For example, if you used Excel to compute 16 * 16, state “I typed =16*16 into Excel and got 256. You may type your answer right into this document.
Part I. Basic Computations
1. (5 points) Consider the following pseudo code for determining any sum in this form:
ComputeSum:
INPUT m
sum = 0
for k = 6 to m do
sum = sum + 5*k^2 + 2*k -10
next k
OUTPUT sum
a. Are the inputs and outputs for this algorithm well defined? Explain.
b. Identify an iterative operation in this algorithm.
2. ( 5 points) Consider this algorithm used to sort an array in this form:
5
8
6
3
5
1
6
19
7
4
S(n) =
BUBBLESORT:
INPUT S, n (an array called S, with n elements)
FOR i = 1 to n – 1
FOR j = 1 to n – 1
if S(j) > S(J+1) then
exchange the contents of S(j) with S(j+1)
NEXT
NEXT
OUTPUT S
Using the following grid, show a trace for this algorithm using the following values:
Part II. Case Study Season Finale: Unlocking the Treasure
The directors and producers of the “Patty Madeye Mysteries” have decided that the season finale for the show will be filmed in a secret location. They have identifed a remote island and visited it to determine what facilities and features are available on the island. The interns that were sent to scout out the island only had time to draw this map of the island and collect some other information.
In order to open the lock to the treasure chest, you will need to solve a puzzle using discrete math. Shown below are the paths and distances that connect the 7 locations on the map.
From
To
Distance
(in meters)
C
D
80
D
E
25
E
G
80
D
G
80
D
A
100
A
F
80
A
G
80
B
A
25
C
B
25
C
E
100
B
E
100
G
F
25
B
F
80
A
C
80
Clue #1: (3 points) One of the things that the film crew will need to know about is the condition of light during the day at the island. The only marking on the island was this binary representation of the longitude. Convert this longitude to decimal so that the crew can estimate time of sunrise and sunset. Show your work.
Longitude:
Answer: =Bin2Dec(10010100) the answer is 148
Clue #2. (3 ...
This presentation is the full application of discrete mathematics throughout a course and includes Set Theory, Functions nd Sequences, Automata Theory, Grammars and algorithm building.
Unit 6 Graph Theory - AssignmentTotal points for Assignment 35 .docxdickonsondorris
Unit 6: Graph Theory - Assignment
Total points for Assignment: 35 points. Assignments must be submitted as a Microsoft Word document and uploaded to the Dropbox for Unit 6. All Assignments are due by Tuesday at 11:59 PM ET of the assigned Unit.
NOTE: Assignment problems should not be posted to the Discussion threads. Questions on the Assignment problems should be addressed to the instructor by sending an email or by attending office hours.
You must show your work on all problems. If a problem is worth 2 points and you only show the answer, then you will receive only 1 point credit. If you use a calculator or online website, give the source and tell me exactly what you provided as input. For example, if you used Excel to compute 16 * 16, state “I typed =16*16 into Excel and got 256. You may type your answer right into this document.
Part I. Basic Computations
1.
(4 points) The plan for a four-room house is shown below. Draw a graph that models the connecting relationships between the areas in the floor plan. [Your graph does not
[Your graph does not need to be fancy. You may use any drawing software such as Visio or Creatly.com]
Answer:
2.
a. Identify all the vertices in the above graph with odd degree. Identify the degree of each of these vertices. (2 points)
Answer:
b.
Describe two paths of different lengths that start at vertex A and which end at vertex F. Specify the length of each path. (2 points)
Answer:
c.
Describe a circuit of length 3. (2 points)
Answer:
d.
Describe two different circuits of length 4 (1 point)
Answer:
3.
Consider this graph:
a. Find an Euler circuit in this graph that starts and ends at vertex D. (1 point)
Answer:
b. Using Euler’s Rules, explain how you know that this graph has an Euler Circuit? (1 point)
Answer:
4.
Paths in a zoo are located according to this map. You want to make sure that you see every exhibit along each path exactly once.
a. Where should you begin and end so that you do not need to retrace your steps? Explain how you know where to start and end. (1 point)
Answer:
Explanation:
b. Find a path such that you do not need to retrace your steps. (1 point)
Answer:
Part II. Case Study
The Case of the Missing Cookies
This week’s episode of “Patty Madeye Mysteries” is based on an investigation at a local Girl Sprouts Camp. Apparently, the Girl Sprout organization has been gearing up for their annual fund-raising event in which members sell cookies and candy at local shopping centers. The proceeds from the fund-raising event are then used to improve the camping facilities (tents, mess-hall, swimming area) at the camp.
In her investigation, Patty determines that the cookies and candy were delivered to the camp on Friday and stored in the camp office. Over the weekend, the camp director moved them into the refrigerator unit in the mess-hall so that they would not melt or spoil. The problem is that the camp director, then lo ...
This presentation is the full application of discrete mathematics throughout a course and includes Set Theory, Functions nd Sequences, Automata Theory, Grammars and algorithm building.
Unit 6 Graph Theory - AssignmentTotal points for Assignment 35 .docxdickonsondorris
Unit 6: Graph Theory - Assignment
Total points for Assignment: 35 points. Assignments must be submitted as a Microsoft Word document and uploaded to the Dropbox for Unit 6. All Assignments are due by Tuesday at 11:59 PM ET of the assigned Unit.
NOTE: Assignment problems should not be posted to the Discussion threads. Questions on the Assignment problems should be addressed to the instructor by sending an email or by attending office hours.
You must show your work on all problems. If a problem is worth 2 points and you only show the answer, then you will receive only 1 point credit. If you use a calculator or online website, give the source and tell me exactly what you provided as input. For example, if you used Excel to compute 16 * 16, state “I typed =16*16 into Excel and got 256. You may type your answer right into this document.
Part I. Basic Computations
1.
(4 points) The plan for a four-room house is shown below. Draw a graph that models the connecting relationships between the areas in the floor plan. [Your graph does not
[Your graph does not need to be fancy. You may use any drawing software such as Visio or Creatly.com]
Answer:
2.
a. Identify all the vertices in the above graph with odd degree. Identify the degree of each of these vertices. (2 points)
Answer:
b.
Describe two paths of different lengths that start at vertex A and which end at vertex F. Specify the length of each path. (2 points)
Answer:
c.
Describe a circuit of length 3. (2 points)
Answer:
d.
Describe two different circuits of length 4 (1 point)
Answer:
3.
Consider this graph:
a. Find an Euler circuit in this graph that starts and ends at vertex D. (1 point)
Answer:
b. Using Euler’s Rules, explain how you know that this graph has an Euler Circuit? (1 point)
Answer:
4.
Paths in a zoo are located according to this map. You want to make sure that you see every exhibit along each path exactly once.
a. Where should you begin and end so that you do not need to retrace your steps? Explain how you know where to start and end. (1 point)
Answer:
Explanation:
b. Find a path such that you do not need to retrace your steps. (1 point)
Answer:
Part II. Case Study
The Case of the Missing Cookies
This week’s episode of “Patty Madeye Mysteries” is based on an investigation at a local Girl Sprouts Camp. Apparently, the Girl Sprout organization has been gearing up for their annual fund-raising event in which members sell cookies and candy at local shopping centers. The proceeds from the fund-raising event are then used to improve the camping facilities (tents, mess-hall, swimming area) at the camp.
In her investigation, Patty determines that the cookies and candy were delivered to the camp on Friday and stored in the camp office. Over the weekend, the camp director moved them into the refrigerator unit in the mess-hall so that they would not melt or spoil. The problem is that the camp director, then lo ...
This presentation looks at relations, functions, sequences and automaton theory and finishes up with binary and sequential algorithm script for searches in psuedocode.
Please Subscribe to this Channel for more solutions and lectures
http://www.youtube.com/onlineteaching
Elementary Statistics Practice Test 2 Solutions
Chapter 4: Probability
Divide-and-Conquer & Dynamic Programming
Divide-and-Conquer: Divide a problem to independent subproblems, find the solutions of the subproblems, and then merge the solutions of the subproblems to the solution of the original problem.
Dynamic Programming: Solve the subproblems (they may overlap with each other) and save their solutions in a table, and then use the table to solve the original problem.
Example 1: Compute Fibonacci number f(0)=0, f(1)=1, f(n)=f(n-1)+f(n-2) Using Divide-and-Conquer:
F(n) = F(n-1) + F(n-2)
F(n-2) + F(n-3) + F(n-3) + F(n-4)
F(n-3)+F(n-4) + F(n-4)+F(n-5) + F(n-4)+F(n-5) + F(n-5) + F(n-6)
…………………….
Computing time: T(n) = T(n-1) + T(n-2), T(1) = 0 T(n)=O(2 ) Using Dynamic Programmin: Computing time=O(n)
n
Chapter 8 Dynamic Programming (Planning)
F(0)
F(1)
F(2)
F(3)
F(4)
……
F(n)
Example 2
The matrix-train mutiplication problem
*
Structure of an optimal parenthesization
Matrix Size
A1 30×35
A2 35×15
A3 15×5
A4 5×10
A5 10×20
A6 20×25
Input
6
5
3
2
4
1
3
3
3
3
3
3
3
3
5
1
2
3
4
5
i
j
1 2 3 4 5
s[i,j]
6
5
3
2
4
i
j
m[i,j]
15125
10500
5375
3500
5000
0
11875
7125
2500
1000
0
9375
4375
750
0
7875
2625
0
15750
0
0
1 2 3 4 5 6
1
i-1
k
j
Matrix-Chain-Order(p)
1 n := length[p] -1;
2 for i = 1 to n
3 do m[i,i] := 0;
4 for l =2 to n
5 do {for i=1 to n-l +1
6 do { j := i+ l-1;
7 m[i,j] := ;
8 for k = i to j-1
9 do {q := m[i,k]+m[k+1,j] +p p p ;
10 if q < m[i,j]
11 then {m[i,j] :=q; s[i,j] := k}; }; };
13 return m, s;
Input of algorithm: p , p , … , p (The size of A = p *p )
Computing time O(n )
8
0
1
n
i
i+1
i
3
Example 3
Longest common subsequence (LCS)
A problem from Bioinformatics: the DNA of one organism may be
S1 = ACCGGTCGAGTGCGCGGAAGCCGGCCGAAA, while the DNA of another organism may be S2 = GTCGTTCTTAATGCCGTTGCTCTGTAAA. One goal of comparing two strands of DNA is to determine how “similar” the two strands are, as some measure of how closely related the two organisms are.
Problem Formulization
Given a sequence X = ( ), another sequence Z = ( ) is a subsequence of X if there exists a strictly increasing sequence ( ) of indices of X such that for all j = 1, 2, …k, we have .
Theorem
Let X = ( ) and Y = ( ...
This presentation looks at relations, functions, sequences and automaton theory and finishes up with binary and sequential algorithm script for searches in psuedocode.
Please Subscribe to this Channel for more solutions and lectures
http://www.youtube.com/onlineteaching
Elementary Statistics Practice Test 2 Solutions
Chapter 4: Probability
Divide-and-Conquer & Dynamic Programming
Divide-and-Conquer: Divide a problem to independent subproblems, find the solutions of the subproblems, and then merge the solutions of the subproblems to the solution of the original problem.
Dynamic Programming: Solve the subproblems (they may overlap with each other) and save their solutions in a table, and then use the table to solve the original problem.
Example 1: Compute Fibonacci number f(0)=0, f(1)=1, f(n)=f(n-1)+f(n-2) Using Divide-and-Conquer:
F(n) = F(n-1) + F(n-2)
F(n-2) + F(n-3) + F(n-3) + F(n-4)
F(n-3)+F(n-4) + F(n-4)+F(n-5) + F(n-4)+F(n-5) + F(n-5) + F(n-6)
…………………….
Computing time: T(n) = T(n-1) + T(n-2), T(1) = 0 T(n)=O(2 ) Using Dynamic Programmin: Computing time=O(n)
n
Chapter 8 Dynamic Programming (Planning)
F(0)
F(1)
F(2)
F(3)
F(4)
……
F(n)
Example 2
The matrix-train mutiplication problem
*
Structure of an optimal parenthesization
Matrix Size
A1 30×35
A2 35×15
A3 15×5
A4 5×10
A5 10×20
A6 20×25
Input
6
5
3
2
4
1
3
3
3
3
3
3
3
3
5
1
2
3
4
5
i
j
1 2 3 4 5
s[i,j]
6
5
3
2
4
i
j
m[i,j]
15125
10500
5375
3500
5000
0
11875
7125
2500
1000
0
9375
4375
750
0
7875
2625
0
15750
0
0
1 2 3 4 5 6
1
i-1
k
j
Matrix-Chain-Order(p)
1 n := length[p] -1;
2 for i = 1 to n
3 do m[i,i] := 0;
4 for l =2 to n
5 do {for i=1 to n-l +1
6 do { j := i+ l-1;
7 m[i,j] := ;
8 for k = i to j-1
9 do {q := m[i,k]+m[k+1,j] +p p p ;
10 if q < m[i,j]
11 then {m[i,j] :=q; s[i,j] := k}; }; };
13 return m, s;
Input of algorithm: p , p , … , p (The size of A = p *p )
Computing time O(n )
8
0
1
n
i
i+1
i
3
Example 3
Longest common subsequence (LCS)
A problem from Bioinformatics: the DNA of one organism may be
S1 = ACCGGTCGAGTGCGCGGAAGCCGGCCGAAA, while the DNA of another organism may be S2 = GTCGTTCTTAATGCCGTTGCTCTGTAAA. One goal of comparing two strands of DNA is to determine how “similar” the two strands are, as some measure of how closely related the two organisms are.
Problem Formulization
Given a sequence X = ( ), another sequence Z = ( ) is a subsequence of X if there exists a strictly increasing sequence ( ) of indices of X such that for all j = 1, 2, …k, we have .
Theorem
Let X = ( ) and Y = ( ...
Similar to Unit 8 Algorithms - AssignmentTotal points for Assignment 3.docx (20)
Francesca Gottschalk - How can education support child empowerment.pptxEduSkills OECD
Francesca Gottschalk from the OECD’s Centre for Educational Research and Innovation presents at the Ask an Expert Webinar: How can education support child empowerment?
Honest Reviews of Tim Han LMA Course Program.pptxtimhan337
Personal development courses are widely available today, with each one promising life-changing outcomes. Tim Han’s Life Mastery Achievers (LMA) Course has drawn a lot of interest. In addition to offering my frank assessment of Success Insider’s LMA Course, this piece examines the course’s effects via a variety of Tim Han LMA course reviews and Success Insider comments.
Biological screening of herbal drugs: Introduction and Need for
Phyto-Pharmacological Screening, New Strategies for evaluating
Natural Products, In vitro evaluation techniques for Antioxidants, Antimicrobial and Anticancer drugs. In vivo evaluation techniques
for Anti-inflammatory, Antiulcer, Anticancer, Wound healing, Antidiabetic, Hepatoprotective, Cardio protective, Diuretics and
Antifertility, Toxicity studies as per OECD guidelines
Instructions for Submissions thorugh G- Classroom.pptxJheel Barad
This presentation provides a briefing on how to upload submissions and documents in Google Classroom. It was prepared as part of an orientation for new Sainik School in-service teacher trainees. As a training officer, my goal is to ensure that you are comfortable and proficient with this essential tool for managing assignments and fostering student engagement.
Unit 8 - Information and Communication Technology (Paper I).pdfThiyagu K
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...Levi Shapiro
Letter from the Congress of the United States regarding Anti-Semitism sent June 3rd to MIT President Sally Kornbluth, MIT Corp Chair, Mark Gorenberg
Dear Dr. Kornbluth and Mr. Gorenberg,
The US House of Representatives is deeply concerned by ongoing and pervasive acts of antisemitic
harassment and intimidation at the Massachusetts Institute of Technology (MIT). Failing to act decisively to ensure a safe learning environment for all students would be a grave dereliction of your responsibilities as President of MIT and Chair of the MIT Corporation.
This Congress will not stand idly by and allow an environment hostile to Jewish students to persist. The House believes that your institution is in violation of Title VI of the Civil Rights Act, and the inability or
unwillingness to rectify this violation through action requires accountability.
Postsecondary education is a unique opportunity for students to learn and have their ideas and beliefs challenged. However, universities receiving hundreds of millions of federal funds annually have denied
students that opportunity and have been hijacked to become venues for the promotion of terrorism, antisemitic harassment and intimidation, unlawful encampments, and in some cases, assaults and riots.
The House of Representatives will not countenance the use of federal funds to indoctrinate students into hateful, antisemitic, anti-American supporters of terrorism. Investigations into campus antisemitism by the Committee on Education and the Workforce and the Committee on Ways and Means have been expanded into a Congress-wide probe across all relevant jurisdictions to address this national crisis. The undersigned Committees will conduct oversight into the use of federal funds at MIT and its learning environment under authorities granted to each Committee.
• The Committee on Education and the Workforce has been investigating your institution since December 7, 2023. The Committee has broad jurisdiction over postsecondary education, including its compliance with Title VI of the Civil Rights Act, campus safety concerns over disruptions to the learning environment, and the awarding of federal student aid under the Higher Education Act.
• The Committee on Oversight and Accountability is investigating the sources of funding and other support flowing to groups espousing pro-Hamas propaganda and engaged in antisemitic harassment and intimidation of students. The Committee on Oversight and Accountability is the principal oversight committee of the US House of Representatives and has broad authority to investigate “any matter” at “any time” under House Rule X.
• The Committee on Ways and Means has been investigating several universities since November 15, 2023, when the Committee held a hearing entitled From Ivory Towers to Dark Corners: Investigating the Nexus Between Antisemitism, Tax-Exempt Universities, and Terror Financing. The Committee followed the hearing with letters to those institutions on January 10, 202
Introduction to AI for Nonprofits with Tapp NetworkTechSoup
Dive into the world of AI! Experts Jon Hill and Tareq Monaur will guide you through AI's role in enhancing nonprofit websites and basic marketing strategies, making it easy to understand and apply.
How to Make a Field invisible in Odoo 17Celine George
It is possible to hide or invisible some fields in odoo. Commonly using “invisible” attribute in the field definition to invisible the fields. This slide will show how to make a field invisible in odoo 17.
Unit 8 Algorithms - AssignmentTotal points for Assignment 3.docx
1. Unit 8: Algorithms - Assignment
Total points for Assignment: 35 points. Assignments must be
submitted as a Microsoft Word document and uploaded to the
Dropbox for Unit 8. All Assignments are due by Tuesday at
11:59 PM ET of the assigned Unit.
NOTE: Assignment problems should not be posted to the
Discussion threads. Questions on the Assignment problems
should be addressed to the instructor by sending an email or by
attending office hours.
You must show your work on all problems. If a problem is
worth 2 points and you only show the answer, then you will
receive only 1 point credit. If you use a calculator or online
website, give the source and tell me exactly what you provided
as input. For example, if you used Excel to compute 16 * 16,
state “I typed =16*16 into Excel and got 256. You may type
your answer right into this document.
Part I. Basic Computations
1. (5 points) Consider the following pseudo code for
determining any sum in this form:
ComputeSum:
INPUT m
sum = 0
for k = 6 to m do
sum = sum + 5*k^2 + 2*k -10
next k
OUTPUT sum
a. Are the inputs and outputs for this algorithm well defined?
Explain.
2. b. Identify an iterative operation in this algorithm.
2. ( 5 points) Consider this algorithm used to sort an array in
this form:
5
8
6
3
5
1
6
19
7
4
S(n) =
BUBBLESORT:
INPUT S, n (an array called S, with n elements)
FOR i = 1 to n – 1
FOR j = 1 to n – 1
if S(j) > S(J+1) then
exchange the contents of S(j) with S(j+1)
NEXT
NEXT
OUTPUT S
Using the following grid, show a trace for this algorithm using
the following values:
3.
4.
5.
6.
7.
8. Part II. Case Study Season Finale: Unlocking the
Treasure
The directors and producers of the “Patty Madeye Mysteries”
have decided that the season finale for the show will be filmed
in a secret location. They have identifed a remote island and
visited it to determine what facilities and features are available
on the island. The interns that were sent to scout out the island
only had time to draw this map of the island and collect some
other information.
In order to open the lock to the treasure chest, you will need to
solve a puzzle using discrete math. Shown below are the paths
9. and distances that connect the 7 locations on the map.
From
To
Distance
(in meters)
C
D
80
D
E
25
E
G
80
D
G
80
D
A
100
A
F
80
A
G
80
B
A
25
C
B
25
C
E
100
B
10. E
100
G
F
25
B
F
80
A
C
80
Clue #1: (3 points) One of the things that the film crew will
need to know about is the condition of light during the day at
the island. The only marking on the island was this binary
representation of the longitude. Convert this longitude to
decimal so that the crew can estimate time of sunrise and
sunset. Show your work.
Longitude:
Answer: =Bin2Dec(10010100) the answer is 148
Clue #2. (3 points) The cast and crew will be staying in the 8
tents shown in the Tent Village. Two of the tents will be set
aside for to be used for “Hair and Makeup” (one for the males,
one for the females). How many different ways can you select
these special tents out of the 8 available?
Answer: =COMBIN(8,2) the answer is 28
11. Clue #3. (3 points) Since the natives on this remote island
only speak Spanish, it is important to know how many people in
the cast & crew of 56 people. The producers have provided the
following information and asked you to prepare a Venn Diagram
depicting the various sets and subsets of this group.
F = {members of the film crew}
S = {members of the cast & crew who speak Spanish}
M = {male members of the cast & crew}
X - n(F) = 10
ok - n(S) = 14
X - n(M) = 15
X - n(F and S) = 4
X - n(F and M) = 5
n(M and S and F) = 3
n(M or S or F) = 28
How many members of the cast & crew are male and speak
Spanish, but are NOT on the Film Crew?
Answer: 7
Clue #4. (3 points) A strange children’s game was found on
the island with the following markings:
53
56
59
62
…
Determine the 20th element of the sequence using the general
term for the sequence.
12. Answer 3*16 the number of boxes needed to be determined
added to the 62 the last number determined 62. The answer (
110 )
Clue #5. (3 points) This clue requires solving a logic problem:
p: cast member is male
q: cast member speaks Spanish
r: cast member has short hair
s: it is NOT raining
If a cast member is male and has short hair, does not speak
Spanish, and it is raining, determine the truth value for the
following expression:
=
Answer:
Clue #6. (3 points) To solve this clue, you must determine if
there exists an Euler path or Euler circuit between the 7
locations on the island. If so, describe it. If not, explain how
you know that such a path or circuit does not exist.
Answer: The image drawn around the map shows this island to
be a ( euler circuit ) because every locations could be visited
exactly once
Clue #7. (2 points) Determine a Minimum Spanning Tree for
the graph described by the paths on the island, using the
distances between the locations as weights.
13. What is the weight of the resulting spanning tree?
Answer:
Clue #8. (5 points) Record your clues here, then use the
following algorithm to determine the 5 digit combination to
unlock the treasure.
Clue #1:
Longitude expressed in decimal: 148
Clue #2:
Number of combinations:28
Clue #3:
n(M + S +~F)
7
Clue #4:
110
Clue #5:
Truth Value
Clue #6:
14. Path, Circuit, or None?
Clue #7:
Weight of spanning tree:
DIGIT1
DIGIT2
DIGIT3
DIGIT4
DIGIT5
148
28
7
110
To unlock the treasure, you must determine the combination for
the lock:
DIGIT1 = 2
FOR i = 1 to Clue#3
DIGIT1 = DIGIT1 + 2
NEXT
DIGIT2 = (Clue#1 / 4) – Clue#2
IF Clue#4 = 71
THEN DIGIT3 = 4
ELSE DIGIT3 = 7
15. IF Clue#5 = True AND Clue #7 < 275
THEN DIGIT4 = 2
ELSE DIGIT4 = 1
IF Path exists in Clue #6
THEN DIGIT5 = 0
ELSE
IF Circuit exists in Clue #6
THEN DIGIT5 = 2
ELSE DIGIT5 = 8
Copyright 2010 – Kaplan University – All Rights Reserved
1 | Page
10010100
(~)(~)(~)
pqrssq
ÙÚÙÅÙ
20
a
=
2
6
(5210)
m
k
kk
=
+-
å
{25,1,26,9,2)
5