Answer:
This problem consists in how you can search for the telephone number of x person in a directory. We try to make it as simple as possible, and in a general way; Without declaring variables or anything, we only did the process necessary to locate a number.
First we made the algorithm
1.Start
2.Go to the section of the municipality where the person lives
3.Locate the first letter of the first surname.
4.Locate the full last name
5.Find the second last name
6.Find the person's name
7.Find the phone
8.End
To make the flowchart we use 'Raptor'
and so we left the diagram
What we take into account first is to locate
the section in which the person we are looking for is located,
then go to the section with the initial letter of the first surname,
then look for the full last name,
and since there are many people with that last name,
we look for the second last name and lastly the first name; And so we got to the phone.
Therefore, in the flowchart, at last we add all the variables to reach the telephone, because this is the case in a directory; You add all the steps you did and as a result you get the phone number of the desired person.