Write a python program to do the following. ask user to enter time in the format of hh: mm: ss. for example, 11: 07: 28. hour must be a two-digit number between 0 and 23, inclusive. minute and second must be two-digit numbers between 0 and 59, inclusive. the program needs to check whether the time entered is valid.
check whether there are exactly two colons. display an error message and stop if the input is invalid.
check whether hour is a two-digit number. display an error message and stop if the input is invalid.
check whether minute is a two-digit number. display an error message and stop if the input is invalid.
check whether second is a two-digit number. display an error message and stop if the input is invalid.
check whether hour is between 0 and 23, inclusive. display an error message and stop if the input is invalid.
check whether minute is between 0 and 59, inclusive. display an error message and stop if the input is invalid.
check whether second is between 0 and 59, inclusive. display an error message and stop if the input is invalid.
if the time entered is valid, remove the colons and display the time. for example, if the input time is 11: 07: 28, the program should display 110728.

Assume that you have an sorted array of records. assume that the length of the array (n) is known. give two different methods to search for a specific value in this array. you can use english or pseudo-code for your algorithm. what is the time complexity for each algorithm and why?

You have a linux system that has a 1000gb hard disk drive, which has a 90gb partition containing an ext4 filesystem mounted to the / directory and a 4gb swap partition. currently, this linux system is only used by a few users for storing small files; however, the department manager wants to upgrade this system and use it to run a database application that will be used by 100 users. the database application and the associated data will take up over 200gb of hard disk space. in addition, these 100 users will store their personal files on the hard disk of the system. each user must have a maximum of 5gb of storage space. the department manager has made it very clear that this system must not exhibit any downtime as a result of hard disk errors. how much hard disk space will you require, and what partitions would you need to ensure that the system will perform as needed? where would these partitions be mounted? what quotas would you implement? what commands would you need to run and what entries to /etc/fstab would you need to create? justify your answers.

This program should be a short piece of code that prints all of the positive integers from 1 to 100 as described more fully below. the program may contain multiple methods, and if using an oo language, should be contained within a single class or object. the program should be designed so that it begins execution when invoked through whichever mechanism is most common for the implementation language. â–ş print out all positive integers from 1 to 100, inclusive and in order. â–ş print messages to standard output, matching the sample output below. â–ş in the output, state whether the each integer is 'odd' or 'even' in the output. â–ş if the number is divisible by three, instead of stating that the number is odd or even, state that the number is 'divisible by three'. â–ş if the number is divisible by both two and three, instead of saying that the number is odd, even or divisible by three; state that the number is 'divisible by two and three'. â–ş design the logic of the loop to be as efficient as possible, using the minimal number of operations to perform the required logic. sample output the number '1' is odd. the number '2' is even. the number '3' is divisible by three. the number '6' is divisible by two and three.