Answer:
Answer is A. One.
Refer below.
Explanation:
A data flow cannot go directly back to the same process it leaves. There must be at least one other process that handle(s) the data flow, produce(s) some other data flow, and return(s) the original data flow to the beginning process.
Answer:
<u>First test:</u> Give a list of disordered numbers to the sorting algorithm an examine if the output is correctly sorted.
<u>Second test:</u> Give a list of ordered numbers to the sorting algorithm an analyze if the output is still correctly ordered.
<u>Third test:</u> Give a list of ordered numbers and some non-numeric values to the sorting algorithm and check how is managed the exception in case of error or if the output is correctly ordered.
I think the answer is n combination r or n permutation r.
Please mark me as brainliest.
