<span>command delete_all_rights(p, q, s)
delete read from a[q, s];
delete write from a[q, s];
delete execute from a[q, s];
delete append from a[q, s];
delete list from a[q, s];
delete modify from a[q, s];
delete own from a[q, s];
end</span>
Answer:
The Following are the solution to this question:
Explanation:
In Option a:
In the point (i) 
is transitive, which means it converts one action to others object because if 
indicates 
. It's true by definition, that becomes valid. But if 
, which implies 
. it's a very essential component. If 
. They 
will also be 
.
In point (ii), The value of 
is convergent since the 
. It means they should be dual a and b constant variable, therefore 
could only be valid for the constant variable, that is 
.
In Option b:
In this algorithm, the input size value is equal to 1 object, and the value of A is a polynomial-time complexity, which is similar to its outcome that is 
. It is the outside there will be a loop(i) for n iterations, that is also encoded inside it, the for loop(j), which would be a loop
. All internal loops operate on a total number of 
generations and therefore the final time complexity is .
Answer:
hope this helps if not srry
