I think the answer is 3 but I’m not sure.
Hope this helps!
Assuming we need to find i such that
1 ≤ i ≤ n and t[i]=i.
If we need to find only the first occurrence, we can do:
for i:1 to n {
if t[i]=i then return(i)
}
If exhaustive search is required, then put the results (values of i) in an array or a linked list, return the number of values found, and the array (or linked list).
The first answer is B: 2 1/2
4 5/6 is put there twice except the last one is subtracting so you can put, 4 5/6 - 4 5/6 = 0 therefore the only number left is 2 1/2
the second one I really don't know sorry:(
The third answer is C because the cases come in 24. But they didn't tell you how many case she brought so the variable has to be by 24 and they took 43 which is the subtracting factor. So the answer is C.
And I also don't know the last one again sorry:(
It maybe be B if i am wrong i am sorry.
Answer:
6.633249581 and I would say it's irrational
Step-by-step explanation:
:)