Assume a system with N job positions. For job position i, the number of individual users in that position is Ui and the number of permissions required for the job position is Pi. a. For a traditional DAC scheme, how many relationships between users and per- missions must be defined? b. For a RBAC scheme, how many relationships between users and permissions must be defined?

(1, –1), (16, –4), (36, –6)

step-by-step explanation:

given that the function is

this can also be written as

we have to graph this function and check which list of points lie on the graph

see attachment for graph:

we find that the points lying are (1,-1) (16,-4) and (36,-6)

since square root is there we find that x can only be posiitve but y can be since square root both positive and negative.

i think the answer is d im not sure

i think it would be c

mark brainliest if im right

step-by-step explanation: