URGENT, I need help to do it on Python Write a function sisseastumine (), which, when run, fills two lists: applicants [], scores []. The number of elements in the lists is limited by the user (either it is stipulated how many people need to be interviewed, or online data is entered until the data about people runs out).
After filling in the lists, a menu appears with a choice of actions:
• Find out the list of people who entered the university (the number of those entered is indicated by the user);
• Display in alphabetical order a list of people and their points;
• Find n people with the worst results;
• Find the average score of the applicants;
• Your own version.
Create the required functions to describe the actions.

Gravity, or gravitation, is a natural phenomenon by which all things with mass or energy—including planets, stars, galaxies, and even light—are brought toward one another.

PLEASE PLEASE PLEASE MARK ME THE BRANIEST

Explanation:

When data items are stored in a collection such as a list, we say that they have a linear or sequential relationship. Each data item is stored in a position relative to the others. In Python lists, these relative positions are the index values of the individual items. Since these index values are ordered, it is possible for us to visit them in sequence. This process gives rise to our first searching technique, the sequential search.

shows how this search works. Starting at the first item in the list, we simply move from item to item, following the underlying sequential ordering until we either find what we are looking for or run out of items. If we run out of items, we have discovered that the item we were searching for was not present.

The Python implementation for this algorithm is shown in CodeLens 1. The function needs the list and the item we are looking for and returns a boolean value as to whether it is present. The boolean variable found is initialized to False and is assigned the value True if we discover the item in the list.

SORRY I DONT KNOW HOW TO ATTACH THE FIGURE DONT FORGET TO MARK ME THE BRANIEST:)

answer; peter zenger;