Answer:
If its any easy question, answer it yourself.
Explanation:
:)
Answer:
Following is the program in Python language
def uniquely_sorted(lst1): #define the function uniquely_sorted
uni_que = [] #creating an array
for number in lst1: #itereating the loop
if number not in uni_que: #check the condition
uni_que.append(number)#calling the function
uni_que.sort() #calling the predefined function sort
return uni_que #returns the unique values in sorted order.
print(uniquely_sorted()([8, 6, 90, 76])) #calling the function uniquely_sorted()
Output:
[6,8,76,90]
Explanation:
Following are the description of the Python program
- Create a functionuniquely_sorted() that takes "lst1" as a list parameter.
- Declared a uni_que[] array .
- Iterating the loop and transfer the value of "lst1" into "number"
- Inside the loop call, the append function .the append function is used for adding the element in the last position of the list.
- Call the predefined function sort(for sorting).
- Finally, call the function uniquely_sorted() inside the print function.
Hmm I think it's the favorite bar
B. negative attitude option
