Consider a set of computer programs, and a binary relation $R$ on this set, where $(a,b)inR$ if and only if:

$($a$)$ Program a has a lower time complexity than program $b.$

$($b$)$ Program a and program $b$ were developed by the same team of engineers.

$($c$)$ Program a and program $b$ were tested by the same set of test cases.

For each of these conditions, determine whether the relation $R$ is reflexive, symmetric, antisymmetric, and$/$or transitive, and justify your answers.