Answer:
O(N!), O(2N), O(N2), O(N), O(logN)
Explanation:
N! grows faster than any exponential functions, leave alone polynomials and logarithm. so O( N! ) would be slowest.
2^N would be bigger than N². Any exponential functions are slower than polynomial. So O( 2^N ) is next slowest.
Rest of them should be easier.
N² is slower than N and N is slower than logN as you can check in a graphing calculator.
NOTE: It is just nitpick but big-Oh is not necessary about speed / running time ( many programmers treat it like that anyway ) but rather how the time taken for an algorithm increase as the size of the input increases. Subtle difference.
If I'm not mistaken firewalls should be enough as now the automatically back up all data
Answer: Systems design
Explanation: SDLC(Systems Development Life Cycle) is the cycle that is responsible for the development of the system including several phases related to it.
The system design phase in SDLC works with the physical or hardware units and the logical reports to make a design interface. This phase makes the requirements of the cycle into design and present it for the analysis so that it can test the efficiency of it.
